167 search results - page 20 / 34 » Nearest Neighbor Queries in Metric Spaces |
SIGMOD
2010
ACM
14 years 10 days ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
In a mobile service scenario, users query a server for nearby points of interest but they may not want to disclose their locations to the service. Intuitively, location privacy may...
COMPGEOM
2004
ACM
14 years 29 days ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
PODS
1998
ACM
13 years 11 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...