158 search results - page 9 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
279
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
170
click to vote
PODS
2000
ACM
15 years 10 months ago
2000
ACM
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
350
click to vote
ICDE
2012
IEEE
13 years 9 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 ...
158
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
207
click to vote
EDBT
2010
ACM
15 years 8 months ago
2010
ACM
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...