4302 search results - page 325 / 861 » Index Pairs Algorithms |
133
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
Nowadays, information is primarily searched on the WWW. From a user perspective, the readability is an important criterion for measuring the accessibility and thereby the quality ...
125
click to vote
SPIRE
2001
Springer
15 years 9 months ago
2001
Springer
Word-based Huffman coding has widespread use in information retrieval systems. Besides its compressing power, it also enables the implementation of both indexing and searching sch...
119
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
137
Voted
BTW
2007
Springer
2007
Springer
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
15 years 8 months ago
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...
159
click to vote
ALENEX
2007
15 years 6 months ago
2007
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...