Sciweavers

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

11

STOC
1999
ACM

favoriteEmaildiscussreport

80views Algorithms» more STOC 1999»

Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems

13 years 9 months ago

Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems

Download www.cs.ucla.edu

Allan Borodin, Rafail Ostrovsky, Yuval Rabani

Real-time Traffic

Algorithms | STOC 1999 |

claim paper

Related Content

» Towards Meaningful HighDimensional Nearest Neighbor Search by HumanComputer Interaction

» Quality and efficiency in high dimensional nearest neighbor search

» Adaptive ClusterDistance Bounding for Nearest Neighbor Search in Image Databases

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

» Lower Bounds on Near Neighbor Search via Metric Expansion

» What Is the Nearest Neighbor in High Dimensional Spaces

» Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces

» Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

» Hierarchical subspace sampling a unified framework for high dimensional data reduction sel...

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	STOC
Authors	Allan Borodin, Rafail Ostrovsky, Yuval Rabani

Comments (0)