{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T05:08:45Z","timestamp":1733375325863,"version":"3.30.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0031-3203(99)00192-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:01:39Z","timestamp":1027609299000},"page":"2083-2093","source":"Crossref","is-referenced-by-count":1,"title":["A complete system for NN classification based on a VLSI array processor"],"prefix":"10.1016","volume":"33","author":[{"given":"A.","family":"Ferrari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Borgatti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Guerrieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(99)00192-2_BIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest Neighbor pattern classification","volume":"IT-14","author":"Cover","year":"1967","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0031-3203(99)00192-2_BIB2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0031-3203(94)00099-8","article-title":"Massive-parallel handwritten character recognition based on the distance transform","volume":"28","author":"Kov\u00e1cs-V","year":"1995","journal-title":"Pattern Recognition"},{"issue":"3","key":"10.1016\/S0031-3203(99)00192-2_BIB3","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TPAMI.1980.4767008","article-title":"A theoretical comparison of texture algorithms","volume":"PAMI-2","author":"Conners","year":"1980","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0031-3203(99)00192-2_BIB4","doi-asserted-by":"crossref","unstructured":"B. Ulug, S.C. Ahalt, R.A. Mitchell, Model-catalog compression for radar target recognition, ICASSP\u201995, Vol. 5, May 1995, pp. 3479\u20133482.","DOI":"10.1109\/ICASSP.1995.479735"},{"issue":"4","key":"10.1016\/S0031-3203(99)00192-2_BIB5","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/TASSP.1979.1163259","article-title":"Speaker-independent recognition of isolated words using clustering techniques","volume":"27","author":"Rabiner","year":"1979","journal-title":"IEEE Trans. ASSP"},{"issue":"11","key":"10.1016\/S0031-3203(99)00192-2_BIB6","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1049\/el:19920680","article-title":"New systolic array for all-nearest-neighbours problem","volume":"28","author":"Lin","year":"1992","journal-title":"IEE Electron. Lett."},{"issue":"3","key":"10.1016\/S0031-3203(99)00192-2_BIB7","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/92.311634","article-title":"A new, cellular automata-based nearest neighbor pattern classifier and its VLSI implementation","volume":"2","author":"Tzionas","year":"1994","journal-title":"IEEE Trans. VLSI Systems"},{"key":"10.1016\/S0031-3203(99)00192-2_BIB8","doi-asserted-by":"crossref","unstructured":"A. Kramer, R. Canegallo, M. Chinosi, D. Doise, G. Gozzini, L. Navoni, P.L. Rolandi, M. Sabatini, 55GCPS CAM using 5b analog flash, IEEE International Solid-State Circuits Conference, Vol. 40, 1997, pp. 44\u201345.","DOI":"10.1109\/ISSCC.1997.585253"},{"issue":"3","key":"10.1016\/S0031-3203(99)00192-2_BIB9","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/92.609875","article-title":"VLSI hardware for example-based learning","volume":"5","author":"Lipman","year":"1997","journal-title":"IEEE Trans. VLSI System"},{"key":"10.1016\/S0031-3203(99)00192-2_BIB10","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","article-title":"The condensed nearest neighbor rule","volume":"IT-14","author":"Hart","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0031-3203(99)00192-2_BIB11","unstructured":"F.P. Fisher, E.A. Patrick, A preprocessing algorithm for nearest neighbor decision rules, Proceedings of the 1970 NEC, pp. 481\u2013485."},{"key":"10.1016\/S0031-3203(99)00192-2_BIB12","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/T-C.1975.224297","article-title":"A branch and bound algorithm for computing K-nearest neighbors","volume":"C-24","author":"Fukunaga","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0031-3203(99)00192-2_BIB13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding best matches in logarithmic expected time","volume":"3","author":"Friedman","year":"1977","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0031-3203(99)00192-2_BIB14","unstructured":"S.M. Omohundro, Five balltree construction algorithms, in: Inter. Comput. Sci. Inst. Technical Report, Vol. TR-89-063, 1987."},{"issue":"6","key":"10.1016\/S0031-3203(99)00192-2_BIB15","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TPAMI.1986.4767859","article-title":"A fast k nearest neighbor finding algorithm based on the ordered partition","volume":"PAMI-8","author":"S. Kim","year":"1986","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0031-3203(99)00192-2_BIB16","unstructured":"K. Fukunaga, Statistical Pattern Recognition, Academic Press, New York, 1990."},{"key":"10.1016\/S0031-3203(99)00192-2_BIB17","unstructured":"R.O. Duda, P.E. Hart, Pattern Classification and Scene Analysis, Wiley, New York, 1973."},{"key":"10.1016\/S0031-3203(99)00192-2_BIB18","unstructured":"S.M. Omohundro, Efficient algorithms with neural network behavior, in: Complex System, Vol. 1, 1987, pp. 273\u2013347."},{"key":"10.1016\/S0031-3203(99)00192-2_BIB19","doi-asserted-by":"crossref","unstructured":"Zs.M. Kov\u00e1cs-V.R. Guerrieri, G. Baccarani, A novel metric for nearest-neighbor classification of hand-written digits, Proceedings of the 11th ICPR 1992 The Hague, The Netherlands, Vol. 2, August 1992, pp. 96\u2013100.","DOI":"10.1109\/ICPR.1992.201730"},{"key":"10.1016\/S0031-3203(99)00192-2_BIB20","unstructured":"J.L. Hennessy, D. Patterson, Computer Architecture A Quantitative Approach, Morgan Kaufmann, Los Altos, CA, 1990 (Chapter 8)."},{"issue":"10","key":"10.1016\/S0031-3203(99)00192-2_BIB21","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1109\/TC.1987.1676863","article-title":"On the complexity of table lookup for iterative division","volume":"c-36","author":"Parhami","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0031-3203(99)00192-2_BIB22","unstructured":"Aptix Corporation, Programmable Interconnect System Data Book, November 1993."},{"key":"10.1016\/S0031-3203(99)00192-2_BIB23","unstructured":"M.D. Garris, R.A. Wilkinson, NIST Special Database 3, NIST Advanced Systems Division, Image Recognition Group, 1992."},{"key":"10.1016\/S0031-3203(99)00192-2_BIB24","doi-asserted-by":"crossref","unstructured":"G.R. Doddington, T.B. Schalk, Speech recognition: turning theory to practice, IEEE Spectrum, 18, September 1981.","DOI":"10.1109\/MSPEC.1981.6369809"},{"issue":"9","key":"10.1016\/S0031-3203(99)00192-2_BIB25","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1109\/5.237532","article-title":"Signal modeling techniques in speech recognition","volume":"81","author":"Picone","year":"1993","journal-title":"Proc. IEEE"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320399001922?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320399001922?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T05:23:00Z","timestamp":1733289780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320399001922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":25,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0031320399001922"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(99)00192-2","relation":{},"ISSN":["0031-3203"],"issn-type":[{"type":"print","value":"0031-3203"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}