ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Peter N. Yianilos NEC Research Institute, 4 Independence Way, Princeton NJ and Princeton University computer science department
Published in:
· Proceeding
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2000
table of contents ISBN:0-89871-453-2
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract) 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 27
· Citation Count: 14


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder