158 search results - page 12 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
128
click to vote
ICAPR
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
180
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
111
click to vote
COMPGEOM
1997
ACM
15 years 3 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
218
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
115
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...