MPI-INF D1 Publications, generated: 11:48, 25 May 2013
Your search returned the following 39 documents:
-
Marjan Celikik, Holger Bast, and Gabriel Manolache
Efficient Index-Based Snippet Generation
. Note: unpublished
-
Hannah Bast
Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 2009, 355-367
-
Marjan Celikik and Holger Bast
Fast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, Honolulu, Hawaii, USA, 2009, 1724-1731
[PDF: Download: spelling-variants.pdf]
-
Marjan Celikik and Hannah Bast
Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, Saariselkä, Finland, 2009, 194-205
-
Holger Bast, Stefan Funke, and Domagoj Matijevic
Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 2009, 175-192
-
Holger Bast, Debapriyo Majumdar, and Ingmar Weber
Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), Lisboa, Portugal, 2007, 857-860
-
Holger Bast, Alexandru Chitea, Fabian Suchanek, and Ingmar Weber
ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), Amsterdam, Netherlands, 2007, 671-678
-
Holger Bast, Stefan Funke, Peter Sanders, and Dominik Schultes
Fast Routing in Road Networks using Transit Nodes
Science 316 (5824): 566 p., 2007
-
Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, and Dominik Schultes
In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), New Orleans, USA, 2007, 46-59
-
Holger Bast and Ingmar Weber
Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), Potsdam, Germany, 2007, 101-108
-
Holger Bast and Ingmar Weber
The CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, 2007, 88-95
[PDF: Download: bastweber07cidr.pdf]
-
Gerhard Weikum, Holger Bast, Geoffrey Canright, David Hales, Christian Schindelhauer, and Peter Triantafillou
Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, Paris, France, 2007
-
Holger Bast, Georges Dupret, Debapriyo Majumdar, and Benjamin Piwowarski
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, Porto, Portugal, 2006, 103-120
-
Holger Bast
Intelligente Suche mit garantiert schnellen Antwortzeiten
MPG Jahrbuch , 2006
-
Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, and Gerhard Weikum
IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, Gaithersburg, Maryland, USA, 2006, 1-5, paper no. 47.
-
Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
Matching Algorithms are Fast in Sparse Random Graphs
Theory of Computing Systems 39 (1): 3-14, 2006
-
Holger Bast, Christian Worm Mortensen, and Ingmar Weber
Output-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, Glasgow, GB, 2006, 150-162
-
Holger Bast, Stefan Funke, and Domagoj Matijevic
TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, Piscataway, New Jersey, 2006
-
Holger Bast and Ingmar Weber
Type Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Seattle, USA, 2006, 364-371
-
Holger Bast and Ingmar Weber
When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, Seattle, USA, 2006, 31-35
-
Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, and Gerhard Weikum
IO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, Seoul, Korea, 2006, 475-486
-
Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, and Gerhard Weikum
IO-Top-k: Index-Access Optimized Top-k Query Processing
Max-Planck-Institut for Informatics, Saarbrücken, MPI–I–2006–5-002, Research Report
[PDF: Download: iotopk_tr.pdf]
-
Holger Bast and Ingmar Weber
Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), Santorini Island, Greece, 2005, 67-76
-
Holger Bast and Ingmar Weber
Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), Tokyo, Japan, 2005, 243-248
-
Holger Bast
Präzisionssuche im homöopathischen Netz
Homöopathie-Zeitschrift I/05: 119-122, 2005
-
Gerhard Weikum, Holger Bast, Geoffrey Canright, David Hales, Christian Schindelhauer, and Peter Triantafillou
Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, Paris, France, 2005, 7-24
-
Holger Bast and Debapriyo Majumdar
Why Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), Salvador, Brazil, 2005, 11-18
[PDF: Download: lsiexplained.pdf]
-
Holger Bast
Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), Bertinoro, Italy, 2004, 113-116
-
Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
Matching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), Montpellier, France, 2004, 81-92
-
Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
Algorithmica 36 (1): 75-88, 2003
-
Hannah Bast
Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, Juan-Les-Pins, France, 2002, 166-178
-
Hannah Bast
On Scheduling Parallel Tasks at Twilight
Theory of Computing Systems 33 (5): 489-563, 2000
-
Hannah Bast
Provably Optimal Scheduling of Similar Tasks
Doctoral dissertation, Universität des Saarlandes, 2000
[PS: Download: 2000.phdthesis.ps.gz]
-
Hannah Bast and Susan Hert
The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), Fredericton, New Brunswick, Canada, August 16th - 19th, 2000, 163-171
-
Hannah Bast
Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), Puerto Vallarta, Mexico, June 28 - July 2, 1998, 1998, 182-191
-
Hannah Bast and Torben Hagerup
Fast Parallel Space Allocation, Estimation, and Integer Sorting
Information and Computation 123 (1): 72-110, 1995
-
Hannah Bast
Fast Parallel Space Allocation, Estimation and Integer Sorting
Master's thesis, Universität des Saarlandes, 1994
-
Holger Bast and Torben Hagerup
Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), Hilton Head Island, South Carolina, USA, 1991, 50-61
-
Holger Bast, Martin Dietzfelbinger, and Torben Hagerup
A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), Prague, Czechoslovakia, 1992, 133-141