Algorithms for fast vector quantization

This publication has 9 references indexed in Scilit:

• Algorithms for fast vector quantization
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Refinements to nearest-neighbor searching ink-dimensional trees
  Algorithmica, 1991
• K-d trees for semidynamic point sets
  Published by Association for Computing Machinery (ACM) ,1990
• A new vector quantization clustering algorithm
  IEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
• A note on relative neighborhood graphs
  Published by Association for Computing Machinery (ACM) ,1987
• The relative neighbourhood graph of a finite planar set
  Pattern Recognition, 1980
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
  ACM Transactions on Mathematical Software, 1977
• Multidimensional binary search trees used for associative searching
  Communications of the ACM, 1975
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
  IEEE Transactions on Computers, 1975