183 search results - page 16 / 37 » Winner-Update Algorithm for Nearest Neighbor Search |
133
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
118
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
167
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
207
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
123
click to vote
ICPR
2000
IEEE
15 years 6 months ago
2000
IEEE
2. Character Recognition System The paper is about the problem of finding good prototypes for a condensed nearest neighbor classifiei- in a recognition system. A comparison study ...