1689 search results - page 83 / 338 » Proximate point searching |
105
click to vote
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
96
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
104
Voted
COMPGEOM
1995
ACM
15 years 4 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
121
click to vote
ISMB
1996
15 years 2 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
126
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...