SIGN IN
SIGN UP
Data structures and algorithms for nearest neighbor search in general metric spaces
Full Text:
PDF
Buy this Article
Author:
Peter N. Yianilos
NEC Research Institute, 4 Independence Way, Princeton, New Jersey
Published in:
· Proceeding
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Pages 311-321
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©1993
table of contents
ISBN:0-89871-313-7
1993 Article
Bibliometrics
· Downloads (6 Weeks): 18
· Downloads (12 Months): 202
· Downloads (cumulative): 2,337
· Citation Count: 175
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
associative memory
clustering
computational geometry
computations on discrete structures
design
experimentation
geometrical problems and computations
measurement
metric space
nearest neighbor
pattern recognition
performance
randomized methods
sorting and searching
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder