Sciweavers

34 search results - page 3 / 7
» alenex 2007
Sort
View
ALENEX
2001
103views Algorithms» more  ALENEX 2001»
13 years 6 months ago
Travel Planning with Self-Made Maps
Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilita...
Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thom...
ALENEX
2001
89views Algorithms» more  ALENEX 2001»
13 years 6 months ago
Estimating Resemblance of MIDI Documents
Abstract. Search engines often employ techniques for determining syntactic similarity of Web pages. Such a tool allows them to avoid returning multiple copies of essentially the sa...
Michael Mitzenmacher, Sean Owen
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
13 years 6 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
ALENEX
2007
158views Algorithms» more  ALENEX 2007»
13 years 6 months ago
Faster Filters for Approximate String Matching
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...
Juha Kärkkäinen, Joong Chae Na
ALENEX
2004
110views Algorithms» more  ALENEX 2004»
13 years 6 months ago
Computation of a Class of COntinued Fraction Constants
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
Loïck Lhote