121 search results - page 5 / 25 » Anytime K-Nearest Neighbor Search for Database Applications |
SSD
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
SIGMOD
2010
ACM
14 years 1 months 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...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...