158 search results - page 13 / 32 » High dimensional reverse nearest neighbor queries |
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...
116
click to vote
ICAPR
2009
Springer
15 years 4 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...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
101
click to vote
SDM
2003
SIAM
14 years 11 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
138
click to vote
SSD
2009
Springer
15 years 4 months ago
2009
Springer
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...