Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
25
click to vote
STOC
1997
ACM
favorite
Email
discuss
report
172
views
Algorithms
»
more
STOC 1997
»
Two Algorithms for Nearest-Neighbor Search in High Dimensions
13 years 11 months ago
Download
www.cs.cornell.edu
Jon M. Kleinberg
Real-time Traffic
Algorithms
|
STOC 1997
|
claim paper
Related Content
»
Analysis of approximate nearest neighbor searching with clustered point sets
»
A Cost Model For Nearest Neighbor Search in HighDimensional Data Space
»
What Is the Nearest Neighbor in High Dimensional Spaces
»
Nearest Neighbor Search on Vertically Partitioned HighDimensional Data
»
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
»
Practical Nearest Neighbor Search in the Plane
»
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
»
Nearest Neighbor Search for Relevance Feedback
»
Quality and efficiency in high dimensional nearest neighbor search
more »
Post Info
More Details (n/a)
Added
07 Aug 2010
Updated
07 Aug 2010
Type
Conference
Year
1997
Where
STOC
Authors
Jon M. Kleinberg
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision