{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:41:03Z","timestamp":1730313663688,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1145\/130385.130396","type":"proceedings-article","created":{"date-parts":[[2004,2,3]],"date-time":"2004-02-03T17:38:17Z","timestamp":1075829897000},"page":"93-102","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Bellman strikes again!"],"prefix":"10.1145","author":[{"given":"Santosh S.","family":"Venkatesh","sequence":"first","affiliation":[{"name":"Electrical Engineering Department, University of Pennsylvania, Philadelphia, PA"}]},{"given":"Robert R.","family":"Snapp","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Electrical Engineering, University of Vermont, Burlington, VT"}]},{"given":"Demetri","family":"Psaltis","sequence":"additional","affiliation":[{"name":"Electrical Engineering Department, California Institute of Technology, Pasadena, CA"}]}],"member":"320","published-online":{"date-parts":[[1992,7]]},"reference":[{"key":"e_1_3_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"e_1_3_2_1_2_2","first-page":"413","volume-title":"Proceedings of the First Annual Hawaii Conference on Systems Theory","author":"Cover T. M.","year":"1968","unstructured":"T. M. Cover . Rates of convergence of nearest neighbor decision procedures . In Proceedings of the First Annual Hawaii Conference on Systems Theory , pages 413 - 415 , 1968 . T. M. Cover. Rates of convergence of nearest neighbor decision procedures. In Proceedings of the First Annual Hawaii Conference on Systems Theory, pages 413-415, 1968."},{"volume-title":"Pattern Classification and Scene Analysis","year":"1973","author":"Duda R. O.","key":"e_1_3_2_1_3_2","unstructured":"R. O. Duda and P. E. Hart . Pattern Classification and Scene Analysis . John Wiley ~ Sons, New York, 1973 . R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley ~ Sons, New York, 1973."},{"key":"e_1_3_2_1_4_2","unstructured":"A. Erd~lyi. Asymptotic Expansions. Dover New York 1956. A. Erd~lyi. Asymptotic Expansions. Dover New York 1956."},{"key":"e_1_3_2_1_5_2","first-page":"185","volume":"11","author":"Fulks W.","year":"1961","unstructured":"W. Fulks and J. O. Sather . Asymptotics II: Laplace's method for multiple integrals. Pacific Journal of Mathematics , 11 : 185 - 192 , 1961 . W. Fulks and J. O. Sather. Asymptotics II: Laplace's method for multiple integrals. Pacific Journal of Mathematics, 11:185-192, 1961.","journal-title":"Asymptotics II: Laplace's method for multiple integrals. Pacific Journal of Mathematics"},{"volume-title":"On the finite sample performance of the nearest neighbor classifter. Submitted","year":"1992","author":"Psaltis D.","key":"e_1_3_2_1_6_2","unstructured":"D. Psaltis , R. R. Snapp , and S. S. Venkatesh . On the finite sample performance of the nearest neighbor classifter. Submitted , 1992 . D. Psaltis, R. R. Snapp, and S. S. Venkatesh. On the finite sample performance of the nearest neighbor classifter. Submitted, 1992."},{"key":"e_1_3_2_1_7_2","first-page":"932","volume-title":"Advances in Neural Information Processing Systems, 3","author":"Snapp R. R.","year":"1991","unstructured":"R. R. Snapp , D. Psaltis , and S. S. Venkatesh . Asymptotic slowing down of the nearest-neighbor classitier . In R. Lippman, J. Moody, and D. Touretzky, editors, Advances in Neural Information Processing Systems, 3 , pages 932 - 938 , San Mateo, CA , 1991 . Morgan Kaufmann . R. R. Snapp, D. Psaltis, and S. S. Venkatesh. Asymptotic slowing down of the nearest-neighbor classitier. In R. Lippman, J. Moody, and D. Touretzky, editors, Advances in Neural Information Processing Systems, 3, pages 932-938, San Mateo, CA, 1991. Morgan Kaufmann."}],"event":{"name":"COLT92: 5th Annual Workshop on Computational Learning Theory","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Pittsburgh Pennsylvania USA","acronym":"COLT92"},"container-title":["Proceedings of the fifth annual workshop on Computational learning theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/130385.130396","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T15:58:12Z","timestamp":1673107092000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/130385.130396"}},"subtitle":["the growth rate of sample complexity with dimension for the nearest neighbor classifier"],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":7,"alternative-id":["10.1145\/130385.130396","10.1145\/130385"],"URL":"https:\/\/doi.org\/10.1145\/130385.130396","relation":{},"subject":[],"published":{"date-parts":[[1992,7]]},"assertion":[{"value":"1992-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}