402 search results - page 9 / 81 » Nearest Surrounder Queries |
ALENEX
2001
13 years 9 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
ICDE
2010
IEEE
14 years 2 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...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
Given a set of objects and a query q, a point p is
called the reverse k nearest neighbor (RkNN) of q if q is one of
the k closest objects of p. In this paper, we introduce the c...
VLDB
2009
ACM
14 years 7 months ago
2009
ACM
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive...
CVDB
2004
ACM
14 years 1 months ago
2004
ACM
Nearest Neighbor Search on Multimedia Indexing Structures Multimedia databases get larger and larger in our days, and this trend is expected to continue in the future. There are v...