260 search results - page 22 / 52 » An Adaptive Index Structure for High-Dimensional Similarity ... |
141
click to vote
VLDB
1999
ACM
15 years 4 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
SISAP
2008
IEEE
15 years 6 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
104
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
130
click to vote
MMM
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...