Sciweavers

272 search results - page 34 / 55
» The compressed permuterm index
Sort
View
TREC
1993
15 years 1 months ago
Retrieval of Partial Documents
Management and retrieval of large volumes of text can be expensive in both space and time. Moreover, the range of document sizes in a large collection such as trec presents difficu...
Alistair Moffat, Ron Sacks-Davis, Ross Wilkinson, ...
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
15 years 12 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
CCIW
2009
Springer
15 years 6 months ago
An Improved Image Re-indexing Technique by Self Organizing Motor Maps
The paper presents a novel Motor Map neural network for re-indexing color mapped images. The overall learning process is able to smooth the local spatial redundancy of the indexes ...
Sebastiano Battiato, Francesco Rundo, Filippo Stan...
SBBD
2004
114views Database» more  SBBD 2004»
15 years 1 months ago
On Coding Navigation Paths for In-Memory Navigation in Persistent Object Stores
We consider matrix index and navigation index approaches to in-memory navigation of persistent object stores. We demonstrate that both approaches can be re-formulated independentl...
Markus Kirchberg, Klaus-Dieter Schewe, Alexei Tret...
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 6 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer