41 search results - page 2 / 9 » Query adaptative locality sensitive hashing |
EDBT
2009
ACM
14 years 3 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...
ICDE
2012
IEEE
11 years 11 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector similarity join size estimation (VSJ). It is a generali...
PAMI
2006
13 years 8 months ago
2006
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
ICIP
2007
IEEE
14 years 10 months ago
2007
IEEE
An image hash should be (1) robust to allowable operations and (2) sensitive to illegal manipulations (like image tampering) and distinct queries. Although existing methods try to...