167 search results - page 8 / 34 » Nearest Neighbor Queries in Metric Spaces |
PODS
1997
ACM
13 years 11 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
ICDE
1998
IEEE
14 years 8 months ago
1998
IEEE
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
K-Nearest Neighbors relies on the definition of a global metric. In contrast, Discriminant Adaptive Nearest Neighbor (DANN) computes a different metric at each query point based o...
FOCS
2006
IEEE
14 years 1 months 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) ...