Author:
Kumar Neeraj,Zhang Li,Nayar Shree
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Comm. ACM 18(9), 509–517 (1975)
2. Sproull, R.F.: Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica 6(4), 579–589 (1991)
3. Omohundro, S.M.: Five balltree construction algorithms. Technical Report 89-063 (1989)
4. Linde, Y., Buzo, A., Gray, R.M.: An algorithm for vector quantizer design. IEEE Transactions on Communications 28(1), 84–94 (1980)
5. Yianilos, P.N.: Data structures and algorithms for nearest neighbour search in general metric spaces. In: Symposium on Discrete algorithms, pp. 311–321 (1993)
Cited by
77 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献