skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: An Algorithm for Finding Best Matches in Logarithmic Expected Time

Journal Article · · ACM Transactions on Mathematical Software
 [1];  [2];  [3]
  1. Stanford Linear Accelerator Center, Stanford University, Stanford, CA
  2. Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC
  3. Department of Computer Science, Stanford University, Stanford, CA

Research Organization:
SLAC National Accelerator Lab., Menlo Park, CA (United States)
Sponsoring Organization:
USDOE Office of Science (SC)
DOE Contract Number:
AC02-76SF00515
OSTI ID:
1443274
Report Number(s):
SLAC-PUB-1549
Journal Information:
ACM Transactions on Mathematical Software, Vol. 3, Issue 3; ISSN 0098-3500
Country of Publication:
United States
Language:
English

References (7)

Multidimensional binary search trees used for associative searching journal September 1975
Some approaches to best-match file searching journal April 1973
Quad trees a data structure for retrieval on composite keys journal January 1974
An Algorithm for Finding Nearest Neighbors journal October 1975
Optimization of k nearest neighbor density estimates journal May 1973
A Branch and Bound Algorithm for Computing k-Nearest Neighbors journal July 1975
Constructing optimal binary decision trees is NP-complete journal May 1976

Similar Records

Optical Cluster-Finding with an Adaptive Matched-Filter Technique: Algorithm and Comparison with Simulations
Journal Article · Mon Oct 29 00:00:00 EDT 2007 · Submitted to Astrophysical Journal · OSTI ID:1443274

Examine realistic financing alternatives to find the best match for your project
Journal Article · Tue Aug 01 00:00:00 EDT 1995 · Hart`s Oil and Gas World · OSTI ID:1443274

Distributed matching scheme and a flexible deterministic matching algorithm for arbitrary systems
Journal Article · Tue May 02 00:00:00 EDT 2017 · OSTI ID:1443274

Related Subjects