Forschungspapier (8)

401.
Forschungspapier
Gao, P.; Su, Y.; Wormald, N.: Induced Subgraphs in Sparse Random Graphs with Given Degree Sequence. (2010), 31 pages, 11 figures S.
402.
Forschungspapier
Andres, B.; Kappes, J. H.; Koethe, U.; Hamprecht, F. A.: The Lazy Flipper: MAP Inference in Higher-Order Graphical Models by Depth-limited Exhaustive Search. (2010), 20 S.
403.
Forschungspapier
Fountoulakis, N.; Panagiotou, K.; Steger, A.: On the Insertion Time of Cuckoo Hashing. (2010), 27 pages, final version accepted by the SIAM Journal on Computing S.
404.
Forschungspapier
Andres, B.; Koethe, U.; Kroeger, T.; Hamprecht, F. A.: Runtime-flexible Multi-dimensional Arrays and Views for C++98 and C++0x. (2010)
405.
Forschungspapier
Andres, B.; Koethe, U.; Kroeger, T.; Hamprecht, F. A.: How to Extract the Geometry and Topology from Very Large 3D Segmentations. (2010)
406.
Forschungspapier
Arora, D.; Feldmann, A.; Schaffrath, G.; Schmid, S.: On the Benefit of Virtualization: Strategies for Flexible Server Allocation. (2010), 10 S.
407.
Forschungspapier
Gao, P.; Wormald, N.: Orientability Thresholds for Random Hypergraphs. (2010), 47 pages, 1 figures, the journal version of [16] S.
408.
Forschungspapier
Schaffrath, G.; Schmid, S.; Feldmann, A.: Generalized and Resource-Efficient VNet Embeddings with Migrations. (2010), 11 S.

Bericht (20)

409.
Bericht
Bericht 2009/2010 (Jahresbericht, 2010). Max-Planck-Institut für Informatik, Saarbrücken (2010), 120 S.
410.
Bericht
Report 2009/2010 (Annual Report, 2010). Max-Planck-Institut für Informatik, Saarbrücken (2010), 120 S.
411.
Bericht
Althaus, E.; Altmeyer, S.; Naujoks, R.: A New Combinatorial Approach to Parametric Path Analysis (AVACS Technical Report, 58). SFB/TR 14 AVACS (2010), 33 S.
412.
Bericht
Anand, A.; Bedathur, S.; Berberich, K.; Schenkel, R.: Efficient Temporal Keyword Queries over Versioned Text. Max-Planck-Institut für Informatik, Saarbrücken (2010), 39 S.
413.
Bericht
Berberich, E.; Hemmer, M.; Kerber, M.: A Generic Algebraic Kernel for Non-linear Geometric Applications. INRIA, Sophia Antipolis, France (2010), 20 S.
414.
Bericht
Berberich, K.; Bedathur, S.; Alonso, O.; Weikum, G.: A Language Modeling Approach for Temporal Information Needs. Max-Planck-Institut für Informatik, Saarbrücken (2010), 29 S.
415.
Bericht
Broschart, A.; Schenkel, R.: Real-time Text Queries with Tunable Term Pair Indexes. Max-Planck-Institut für Informatik, Saarbrücken (2010), 41 S.
416.
Bericht
Das Sarma, A.; Theobald, M.; Widom, J.: LIVE: A Lineage-Supported Versioned DBMS. Standford University, Standford (2010), 13 S.
417.
Bericht
Elbassuoni, S.; Ramanath, M.; Weikum, G.: Query Relaxation for Entity-relationship Search. Max-Planck Institut für Informatik, Saarbrücken (2010)
418.
Bericht
Faber, J.; Ihlemann, C.; Jacobs, S.; Sofronie-Stokkermans, V.: Automatic Verification of Parametric Specifications with Complex Topologies (AVACS Technical Report, 66). SFB/TR 14 AVACS (2010), 40 S.
419.
Bericht
Hoffart, J.; Suchanek, F. M.; Berberich, K.; Weikum, G.: YAGO2: A Spatially and Temporally Enhanced Knowledge Base from Wikipedia. Max-Planck-Institut für Informatik, Saarbrücken (2010), 55 S.
420.
Bericht
Huang, C.-C.; Kavitha, T.: Maximum Cardinality Popular Matchings in Strict Two-sided Preference Lists. Max-Planck-Institut für Informatik, Saarbrücken (2010), 17 S.
Zur Redakteursansicht