An Algorithm for Finding Best Matches in Logarithmic Expected Time Export

@article{Friedman:1977:BestMatchesInLog, abstract = {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.}, address = {New York, NY, USA}, author = {Friedman, Jerome H. and Bentley, Jon L. and Finkel, Raphael A.}, citeulike-article-id = {620480}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=355744.355745}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/355744.355745}, doi = {10.1145/355744.355745}, issn = {0098-3500}, journal = {ACM Trans. Math. Softw.}, keywords = {clustering, kd-tree}, month = {September}, number = {3}, pages = {209--226}, posted-at = {2007-09-17 18:53:45}, priority = {5}, publisher = {ACM}, title = {An Algorithm for Finding Best Matches in Logarithmic Expected Time}, url = {http://dx.doi.org/10.1145/355744.355745}, volume = {3}, year = {1977} }

TY - JOUR ID - Friedman:1977:BestMatchesInLog L3 - citeulike-article-id:620480 N2 - 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. IS - 3 JF - ACM Trans. Math. Softw. SN - 0098-3500 AD - New York, NY, USA EP - 226 TI - An Algorithm for Finding Best Matches in Logarithmic Expected Time PB - ACM VL - 3 SP - 209 KW - clustering KW - kd-tree AU - Friedman, Jerome AU - Bentley, Jon AU - Finkel, Raphael PY - 1977/09// UR - http://dx.doi.org/10.1145/355744.355745 ER -