Sciweavers

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

98

Voted

PR
2007

155views more PR 2007»

Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

15 years 2 months ago

Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

Download www.ece.cmu.edu

Yong-Sheng Chen, Yi-Ping Hung, Ting-Fang Yen, Chio

Real-time Traffic

PR 2007 |

claim paper

Related Content

» Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree

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

» KNearest Neighbor Finding Using MaxNearestDist

» A fast nearest neighbor search algorithm by nonlinear embedding

» Lower Bounds on Near Neighbor Search via Metric Expansion

» Fast Nearest Neighbor Search on Road Networks

» Fast k Nearest Neighbor Search using GPU

» Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches

» Similarity search and locality sensitive hashing using ternary content addressable memorie...

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	PR
Authors	Yong-Sheng Chen, Yi-Ping Hung, Ting-Fang Yen, Chiou-Shann Fuh

Comments (0)