Sciweavers

402 search results - page 18 / 81
» Nearest Surrounder Queries
Sort
View
SPIRE
2005
Springer
15 years 3 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
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...
Rodrigo Paredes, Edgar Chávez
139
Voted
CORR
1999
Springer
222views Education» more  CORR 1999»
14 years 9 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
GIS
2009
ACM
15 years 4 months ago
Constrained reverse nearest neighbor search on mobile objects
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
ESORICS
2009
Springer
15 years 4 months ago
A Spatial Cloaking Framework Based on Range Search for Nearest Neighbor Search
For nearest neighbor search, a user queries a server for nearby points of interest (POIs) with his/her location information. Our aim is to protect the user’s sensitive informatio...
Hyoungshick Kim
FOCS
2006
IEEE
15 years 3 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
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) ...
Alexandr Andoni, Piotr Indyk