134 search results - page 13 / 27 » Approximate Nearest Neighbor Queries in Fixed Dimensions |
193
click to vote
ICDE
2012
IEEE
13 years 2 days 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 ...
109
Voted
ICIP
2007
IEEE
15 years 3 months ago
2007
IEEE
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
112
click to vote
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
KDD
1999
ACM
15 years 1 months ago
1999
ACM
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...