Jerome H. Friedman
- 1 BENTLEY, J.L. Multidimensional binary search trees used for associative searching. Comm. ACM 18, 9 (Sept. 1975), 509-517. Google Scholar
- 2 BURKHARV, W.A., AND KELLER, R M. Some approaches to best match file searching. Comm. ACM 16, 4 (April 1973), 230-236. Google Scholar
- 3 FINKEL, R.A., AND BENTLEY, J.L. Quad trees--a data structure for retrmval on composite keys. Acta Informatica 4, 1 (1974), 1-9.Google Scholar
- 4 FRIEDMAN, J.H., BASKETT, F., AND SHUSTEK, L.J. An algorithm for finding nearest neighbors. IEEE Trans. Comptrs C-24 (1975), 1000-1006.Google Scholar
- 5 FUKUNAGA, K., AND HOSTETLER, L.D Optimization of k-nearest neighbor density estimates. 1EEE Trans. Inform Theory IT-19 (1973), 320-326.Google Scholar
- 6 FUKUNAGA, K., AND NARENDRA, P.M. A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comptrs. C-24 (1975), 750-753.Google Scholar
- 7 HYAYIL, L., Am) RZVEST, R.L. Constructing optimal binary decision trees is NP-complete. Information Processing Letters 5, (May 1976), 15-17.Google Scholar
- 8 KNUTH, D.E. The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, Mass., 1969, p. 401. Google Scholar
- 9 PIZER, S.M. Numerical Computing and Mathematical Analysis, Science Research Associates, Chicago, Ill., 1975, p. 88, eq. 87.Google Scholar
- 10 RIVEST, R. On the optimality of Elias' algorithm for performing best match searches. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 678-681.Google Scholar
- 11 SHAMOS, M.I. Geometric Complexity. Conf. Rec. Seventh Annual ACM Syrup. on Theory of Comptng, Albuquerque, N.Mex., May 1975, 224-233. Google Scholar
Index Terms
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
Recommendations
Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time
Given ann-vertex,m-edge directed networkGwith real costs on the edges and a designated source vertexs, we give a new algorithm to compute shortest paths froms. Our algorithm is a simple deterministic one withO(n2logn) expected running time over a large ...
An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM
Improving a long chain of works, we obtain a randomised EREW PRAM algorithm for finding the connected components of a graphG=(V, E) withnvertices andmedges inO(logn) time using an optimal number ofO((m+n)/logn) processors. The result returned by the ...
Comments