144 search results - page 2 / 29 » Query dependent ranking using K-nearest neighbor |
SPIRE
2005
Springer
14 years 10 days 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...
PVLDB
2008
13 years 5 months ago
2008
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
EDBT
2010
ACM
13 years 8 months ago
2010
ACM
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
ICDE
2010
IEEE
14 years 1 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
DASFAA
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...