325 search results - page 34 / 65 » Group Nearest Neighbor Queries |
IJFCS
2002
13 years 9 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
GIS
2008
ACM
13 years 11 months ago
2008
ACM
The use of centralized, real-time position tracking is proliferating in the areas of logistics and public transportation. Real-time positions can be used to provide up-to-date inf...
PODS
1989
ACM
14 years 1 months ago
1989
ACM
In this paper we propose the use of fractals and especially the Hilbert curve, in order to design good distance-preserving mappings. Such mappings improve the performance of secon...
TKDE
2010
13 years 8 months ago
2010
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...