92 search results - page 1 / 19 » Similarity Search in High Dimensions via Hashing |
138
Voted
VLDB
1999
ACM
15 years 3 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 ...
112
click to vote
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
CRV
2005
IEEE
15 years 5 months ago
2005
IEEE
72
Voted
MMM
2007
Springer
15 years 6 months ago
2007
Springer
114
Voted
SSDBM
2009
IEEE
15 years 6 months ago
2009
IEEE
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...