Author:
Cano Javier,Perez-Cortes Juan-Carlos,Arlandis Joaquim,Llobet Rafael
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45:891–923, 1998.
2. J. L. Bentley, B. W. Weide, and A. C. Yao. Optimal expected time algorithms for closest point problems. ACM Trans. on Math. Software, 6:563–580, 1980.
3. P. A. Devijver and J. Kittler. On the edited nearest neighbour rule. In Proceedings of the 5th International Conference on Pattern Recognition, pages 72–80. IEEE Computer Society Press, Los Alamitos, CA, 1980.
4. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm finding best matches in logarithmic expected time. ACM Trans. Math. Software, 3:209–226, 1977.
5. T. M. Ha and H. Bunke. Off-line, handwritten numeral recognition by perturbation method. IEEE Trans. on PAMI, 19(5):535–539, May 1997.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献