Expected-case complexity of approximate nearest neighbor searching

Authors:
Sunil Arya;Ho-Yam Addy Fu
Affiliations:
Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Vector quantization and signal compression

Vector quantization and signal compression
An algorithm for approximate closest-point queries

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Two algorithms for nearest-neighbor search in high dimensions

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate nearest neighbor queries revisited

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)

Efficient Expected-Case Algorithms for Planar Point Location

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Effective 3D action recognition using EigenJoints

Journal of Visual Communication and Image Representation

Hi-index	0.00