An Algorithm for Finding Best Matches in Logarithmic Expected Time

Abstract

article Free Access Share on An Algorithm for Finding Best Matches in Logarithmic Expected Time Authors: Jerome H. Friedman Stanford Linear Accelerator Center, Stanford University, Stanford, CA Stanford Linear Accelerator Center, Stanford University, Stanford, CAView Profile , Jon Louis Bentley Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NCView Profile , Raphael Ari Finkel Department of Computer Science, Stanford University, Stanford, CA Department of Computer Science, Stanford University, Stanford, CAView Profile Authors Info & Claims ACM Transactions on Mathematical SoftwareVolume 3Issue 3Sept. 1977 pp 209–226https://doi.org/10.1145/355744.355745Published:01 September 1977Publication History 1,839citation9,602DownloadsMetricsTotal Citations1,839Total Downloads9,602Last 12 Months857Last 6 weeks164 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF