Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
January 1, 1993

Approximate nearest neighbor queries in fixed dimensions

View Full Paper
Ask AI
Bookmark
Share

Authors

SASunil AryaHong Kong University of Science and TechnologyDMDavid M. MountUniversity of Maryland, College Park

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Arya et al. (1993) studied this question.

synapsesocial.com/papers/6a10da7b39dd87f6d0ee7137https://doi.org/10.5555/313559.313768
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Skip lists: a probabilistic alternative to balanced trees1990 · 1,171 citations
  2. 2Reporting points in halfspaces2002 · 33 citations
  3. 3Probability of Error for Optimal Codes in a Gaussian Channel1959 · 820 citations
  4. 4On Constructing Minimum Spanning Trees in k -Dimensional Spaces and Related Problems1982 · 610 citations
  5. 5An Algorithm for Finding Best Matches in Logarithmic Expected Time1977 · 2,829 citations