Sciweavers

96 search results - page 1 / 20
» Average-Case Analysis of a Nearest Neighbor Algorithm
Sort
View
IJCAI
1993
14 years 3 days ago
Average-Case Analysis of a Nearest Neighbor Algorithm
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
Pat Langley, Wayne Iba
SODA
1994
ACM
138views Algorithms» more  SODA 1994»
14 years 3 days ago
Average Case Analysis of Dynamic Geometric Optimization
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
David Eppstein
CVPR
2012
IEEE
12 years 1 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
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...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
VMV
2003
170views Visualization» more  VMV 2003»
14 years 4 days ago
Performance Analysis of Nearest Neighbor Algorithms for ICP Registration of 3-D Point Sets
There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on efficient nearest nei...
Timo Zinßer, Jochen Schmidt, Heinrich Nieman...
WADS
2001
Springer
97views Algorithms» more  WADS 2001»
14 years 3 months ago
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching
Songrit Maneewongvatana, David M. Mount