27 search results - page 5 / 6 » spire 2005 |
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We introduce a new data structure, called MiGaL for “Multiple Graph Layers”, that is composed of various graphs linked together ions of abstraction/refinement. The n...
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
Large inverted indices are by now common in the construction of web-scale search engines. For faster access, inverted indices are indexed internally so that it is possible to skip...
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
This paper proposes a model for Information Retrieval (IR) based on possibilistic directed networks. Relations documents-terms and query-terms are modeled through possibility and n...