158 search results - page 10 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
75
Voted
CCCG
2006
14 years 10 months ago
2006
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
90
Voted
SSD
2007
Springer
2007
Springer
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
15 years 3 months ago
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
71
Voted
STOC
2002
ACM
15 years 9 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
111
click to vote
SPIRE
2005
Springer
15 years 2 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...