论文信息 - ANN Programming Manual - 字舞流文

ANN Programming Manual

[1] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[2] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[3] Jon Louis Bentley,et al. K-d trees for semidynamic point sets , 1990, SCG '90.

[4] Sunil Arya,et al. Approximate nearest neighbor queries in fixed dimensions , 1993, SODA '93.

[5] Sunil Arya,et al. Algorithms for fast vector quantization , 1993, [Proceedings] DCC `93: Data Compression Conference.

[6] Mark H. Overmars. Designing the Computational Geometry Algorithms Library CGAL , 1996, WACG.

[7] Kenneth L. Clarkson,et al. Nearest Neighbor Queries in Metric Spaces , 1997, STOC '97.

[8] Jon M. Kleinberg,et al. Two algorithms for nearest-neighbor search in high dimensions , 1997, STOC '97.

[9] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.