121 search results - page 13 / 25 » Anytime K-Nearest Neighbor Search for Database Applications |
210
Voted
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
224
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
105
click to vote
EDBT
2008
ACM
16 years 1 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
152
click to vote
VLDB
2000
ACM
15 years 5 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
221
click to vote
ICDE
2009
IEEE
16 years 3 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...