868 search results - page 29 / 174 » A general compression algorithm that supports fast searching |
CIKM
2010
Springer
13 years 5 months ago
2010
Springer
Though children frequently use web search engines to learn, interact, and be entertained, modern web search engines are poorly suited to children's needs, requiring relativel...
FSE
2008
Springer
13 years 9 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
BMCBI
2010
13 years 7 months ago
2010
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
STRINGOLOGY
2008
13 years 9 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...