|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
ABRAMOWITZ, M, AND STEGUN, I.A. Handbook of Mathematwal Functions Appl. Math Ser. 55, Nat. Bureau Standards, Washington, D.C, 1965
|
 |
2
|
|
| |
3
|
|
| |
4
|
FINKEL, R.A, AND BENTLEY, J.L Quad treesma data structure used for associative searching. Acta Inform 4, 1 (1974), 1-9.
|
| |
5
|
FRIEDMAN, J H, BASKETT, F, AND SHUSTEK, L J. An algorithm for finding nearest neighbors IEEE Trans. Comput. C-24 (1975), 1000-1006.
|
| |
6
|
|
| |
7
|
FUKUNAGA, K, AND NARENDRA, P.M. A branch and bound algorithm for computing k-nearest neighbors IEEE Trans. Comput C-24 (1975), 750-753.
|
| |
8
|
MlcmE, D. Memo functions and machine learning. Nature 281, 19 (April 1968), 306
|
| |
9
|
MINSKY, M., AND PAPERT, S Perceptzons. M.I.T. Press, Cambridge, Mass, 1969
|
| |
10
|
RIVEST, R L. On the optimality of Ehas's algorithm for performing best-match searches. Infor. marion Processing "74 North Holland Publ Co., 1974, pp. 678-681
|
| |
11
|
SAMPSON, J.R., AND TARTAR, J Improved memo functions with apphcahons m real time computing. INFOR 12, 2 (June 1974), 117-130.
|
| |
12
|
YUVAL, G. Finding near neighbors in K-dimensional space, IFPL 3, 4 (March 1975), 113-114.
|
CITED BY 16
|
|
Xiaobin Ma , Shashi Shekhar , Hui Xiong , Pusheng Zhang, Exploiting a page-level upper bound for multi-type nearest neighbor queries, Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems, November 10-11, 2006, Arlington, Virginia, USA
|
|
|
Jiann-Der Lee , Chung-Hsien Huang , Li-Chang Liu , Shin-Tseng Lee , Shih-Sen Hsieh , Shuen-Ping Wang, A Modified Soft-Shape-Context ICP Registration System of 3-D Point Data, IEICE - Transactions on Information and Systems, v.E90-D n.12, p.2087-2095, December 2007
|
|
|
Timothy J. Purcell , Craig Donner , Mike Cammarano , Henrik Wann Jensen , Pat Hanrahan, Photon mapping on programmable graphics hardware, ACM SIGGRAPH 2005 Courses, July 31-August 04, 2005, Los Angeles, California
|
|
|
|
|
|
Timothy J. Purcell , Craig Donner , Mike Cammarano , Henrik Wann Jensen , Pat Hanrahan, Photon mapping on programmable graphics hardware, Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware, July 26-27, 2003, San Diego, California
|
|
|
Sunil Arya , David M. Mount , Onuttom Narayan, Accounting for boundary effects in nearest neighbor searching, Proceedings of the eleventh annual symposium on Computational geometry, p.336-344, June 05-07, 1995, Vancouver, British Columbia, Canada
|
|
|
Stefan Berchtold , Christian Böhm , Daniel A. Keim , Hans-Peter Kriegel, A cost model for nearest neighbor search in high-dimensional data space, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.78-86, May 11-15, 1997, Tucson, Arizona, United States
|
|
|
Sunil Arya , David M. Mount , Nathan S. Netanyahu , Ruth Silverman , Angela Wu, An optimal algorithm for approximate nearest neighbor searching, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.573-582, January 23-25, 1994, Arlington, Virginia, United States
|
|
|
Mirko Zadravec , Andrej Brodnik , Markus Mannila , Merja Wanne , Borut alik, A practical approach to the 2D incremental nearest-point problem suitable for different point distributions, Pattern Recognition, v.41 n.2, p.646-653, February, 2008
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.2