Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

WADS
2001
Springer

favoriteEmaildiscussreport

97views Algorithms» more WADS 2001»

The Analysis of a Probabilistic Approach to Nearest Neighbor Searching

14 years 3 months ago

The Analysis of a Probabilistic Approach to Nearest Neighbor Searching

Download www.cs.umd.edu

Songrit Maneewongvatana, David M. Mount

Real-time Traffic

Algorithms | WADS 2001 |

claim paper

Related Content

» An Empirical Study of a New Approach to Nearest Neighbor Searching

» Probabilistic Group Nearest Neighbor Queries in Uncertain Databases

» Analysis of approximate nearest neighbor searching with clustered point sets

» A Comparison of Nearest Neighbor Search Algorithms for Generic Object Recognition

» Fast Nearest Neighbor Search on Road Networks

» A Tabular Pruning Rule in TreeBased Fast Nearest Neighbor Search Algorithms

» PAC Nearest Neighbor Queries Approximate and Controlled Search in HighDimensional and Metr...

» Approximate Nearest Neighbor Searching in Multimedia Databases

» Incremental and General Evaluation of Reverse Nearest Neighbors

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	WADS
Authors	Songrit Maneewongvatana, David M. Mount

Comments (0)