158 search results - page 11 / 32 » High dimensional reverse nearest neighbor queries |
174
click to vote
ICDE
2009
IEEE
15 years 11 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 {...
JMLR
2006
14 years 9 months ago
2006
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
CVPR
2010
IEEE
14 years 8 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
214
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
Important factors affecting the efficiency and performance of the nearest neighbor classifier (NNC) are space, classification time requirements and for high dimensional data, due ...