An Algorithm for Finding Best Matches in Logarithmic Expected Time

Full Text: PDFPDF Get this ArticleGet this Article
Authors: Jerome H. Friedman Stanford Linear Accelerator Center, Stanford University, Stanford, CA
Jon Louis Bentley Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC
Raphael Ari Finkel Department of Computer Science, Stanford University, Stanford, CA
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 3 Issue 3, Sept. 1977
Pages 209-226
ACM New York, NY, USA
table of contents doi>10.1145/355744.355745
An Algorithm for Finding Best Matches in Logarithmic Expected Time Published by ACM 1977 Article
Bibliometrics Data  Bibliometrics
· Citation Count: 445
· Downloads (cumulative): 7,002
· Downloads (12 Months): 514
· Downloads (6 Weeks): 68


Author Tags Expand Author Tags
Contact The DL Team Contact Us | 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 © 2017 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder