{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:00:23Z","timestamp":1648584023589},"reference-count":43,"publisher":"Elsevier BV","issue":"4-5","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1016\/s0167-8191(05)80143-7","type":"journal-article","created":{"date-parts":[[2005,7,19]],"date-time":"2005-07-19T10:20:40Z","timestamp":1121768440000},"page":"381-407","source":"Crossref","is-referenced-by-count":2,"title":["Nearest neighbor classification on two types of SIMD machines"],"prefix":"10.1016","volume":"17","author":[{"given":"Xiaobo","family":"Li","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(05)80143-7_bib1","series-title":"Highly Parallel Computing","author":"Almasi","year":"1989"},{"key":"10.1016\/S0167-8191(05)80143-7_bib2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TC.1977.5009297","article-title":"The multidimensional access memory in STARAN","author":"Batcher","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(05)80143-7_bib3","doi-asserted-by":"crossref","first-page":"1566","DOI":"10.1109\/T-C.1971.223171","article-title":"The organization and use of parallel memories","author":"Budnik","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(05)80143-7_bib4","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1109\/T-C.1974.223827","article-title":"Finding prototypes for nearest neighbor classifiers","volume":"C-23","author":"Chang","year":"1974","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(05)80143-7_bib5","series-title":"Proc. Internat. Conf. on Information Science and Systems","article-title":"Is your nearest neighbor near enough a neighbor","author":"Dasarathy","year":"1976"},{"key":"10.1016\/S0167-8191(05)80143-7_bib6","series-title":"Proc. Internat. Conf. on Cybernetics and Society","first-page":"630","article-title":"Visiting nearest neighbors","author":"Dasarathy","year":"1977"},{"issue":"4","key":"10.1016\/S0167-8191(05)80143-7_bib7","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-8191(05)80143-7_bib8","series-title":"Pattern Recognition: A Statistical Approach","author":"Devijver","year":"1982"},{"key":"10.1016\/S0167-8191(05)80143-7_bib9","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"issue":"6","key":"10.1016\/S0167-8191(05)80143-7_bib10","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/TPAMI.1987.4767990","article-title":"Parallel algorithms for image template matching on hypercube SIMD computers","volume":"PAMI-9","author":"Fang","year":"1987","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"10.1016\/S0167-8191(05)80143-7_bib11","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/12.16495","article-title":"On the communication complexity of generalized 2-D convolution on array processors","volume":"38","author":"Fang","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(05)80143-7_bib12","first-page":"481","article-title":"A preprocessing algorithm for nearest neighbor decision rules","volume":"26","author":"Fischer","year":"1970"},{"key":"10.1016\/S0167-8191(05)80143-7_bib13","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/T-C.1975.224110","article-title":"An algorithm for finding nearest neighbors","author":"Friedman","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(05)80143-7_bib14","series-title":"Special Computer Architecture for Pattern Analysis","author":"Fu","year":"1982"},{"key":"10.1016\/S0167-8191(05)80143-7_bib15","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":"24","author":"Fukunaga","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(05)80143-7_bib16","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","article-title":"The reduced nearest neighbor rule","volume":"IT-18","author":"Gates","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0167-8191(05)80143-7_bib17","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\/S0167-8191(05)80143-7_bib18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/TSSC.1970.300339","article-title":"The nearest neighbor classification rule with a rejection option","volume":"SSC-6","author":"Hellman","year":"1970","journal-title":"IEEE Trans. Systems Science Cybernet."},{"key":"10.1016\/S0167-8191(05)80143-7_bib19","series-title":"The Connection Machine","author":"Hillis","year":"1985"},{"key":"10.1016\/S0167-8191(05)80143-7_bib20","series-title":"Computer Architecture and Parallel Processing","author":"Hwang","year":"1984"},{"key":"10.1016\/S0167-8191(05)80143-7_bib21","series-title":"Algorithms for Clustering Data","author":"Jain","year":"1988"},{"issue":"2","key":"10.1016\/S0167-8191(05)80143-7_bib22","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0743-7315(87)90002-5","article-title":"Communication efficient basic linear algebra computations on hypercube architectures","author":"Johnsson","year":"1987","journal-title":"J. Parallel Distributed Computat."},{"key":"10.1016\/S0167-8191(05)80143-7_bib23","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0167-8655(85)90036-4","article-title":"An improved branch and bound algorithm for computing k-nearest neighbors","volume":"3","author":"Kamgar-Parsi","year":"1985","journal-title":"Pattern Recognition Letters"},{"key":"10.1016\/S0167-8191(05)80143-7_bib24","article-title":"A multiple-processor architecture for image processing","author":"Lee","year":"1987"},{"issue":"6","key":"10.1016\/S0167-8191(05)80143-7_bib25","doi-asserted-by":"crossref","DOI":"10.1016\/0031-3203(88)90028-3","article-title":"Parallel processing approaches to edge relaxation","volume":"21","author":"Leung","year":"1988","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0167-8191(05)80143-7_bib26","series-title":"Proc. IEEE Computer Society Conf. on Computer Vision and Pattern Recognition","first-page":"130","article-title":"Parallel algorithms for clustering on hypercube SIMD computers","author":"Li","year":"1986"},{"key":"10.1016\/S0167-8191(05)80143-7_bib27","series-title":"Parallel Hierarchical clustering and cluster validity computation","author":"Li","year":"1988"},{"key":"10.1016\/S0167-8191(05)80143-7_bib28","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0743-7315(90)90047-S","article-title":"Simulated parallel architectures in a distributed environment","volume":"9","author":"Li","year":"1990","journal-title":"J. Parallel Distributed Comput."},{"issue":"2","key":"10.1016\/S0167-8191(05)80143-7_bib29","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TPAMI.1987.4767899","article-title":"The nearest neighbor and the Bayes error rates","volume":"PAMI-9","author":"Loizou","year":"1987","journal-title":"IEEE Trans. Pattern Analysis Machine Intelligence"},{"key":"10.1016\/S0167-8191(05)80143-7_bib30","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-8655(86)90059-0","article-title":"An alternative nearest neighbor classification","volume":"4","author":"Luk","year":"1986","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"10.1016\/S0167-8191(05)80143-7_bib31","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/TPAMI.1985.4767620","article-title":"A VLSI systolic architecture for pattern clustering","volume":"PAMI-7","author":"Ni","year":"1985","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"4","key":"10.1016\/S0167-8191(05)80143-7_bib32","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","article-title":"An algorithm for finding nearest neighbor in (approximately) constant average time","author":"Vidal Ruiz","year":"1986","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"10.1016\/S0167-8191(05)80143-7_bib33","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","article-title":"The cosmic cube","volume":"28","author":"Seitz","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/S0167-8191(05)80143-7_bib34","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1982.1675976","article-title":"Parallel processing approaches to image correlation","volume":"C-31","author":"Siegel","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(05)80143-7_bib35","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(05)80143-7_bib36","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TSMC.1976.4309452","article-title":"Two modifications of CNN","volume":"SMC-6","author":"Tomek","year":"1976","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0167-8191(05)80143-7_bib37","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/TSMC.1976.5409182","article-title":"A generalization of the k-NN rule","volume":"SMC-6","author":"Tomek","year":"1976","journal-title":"IEEE Trans. Systems Man Cybernet."},{"issue":"1","key":"10.1016\/S0167-8191(05)80143-7_bib38","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/MSPEC.1986.6370959","article-title":"Minis and mainframes","volume":"23","author":"Wallich","year":"1986","journal-title":"IEEE Spectrum"},{"key":"10.1016\/S0167-8191(05)80143-7_bib39","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/MSPEC.1987.6447894","article-title":"A parallel architecture comes of age at last","author":"Wiley","year":"1987","journal-title":"IEEE Spectrum"},{"key":"10.1016\/S0167-8191(05)80143-7_bib40","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","article-title":"Asymptotic properties of nearest neighbor rule using edited data","volume":"SMC-2","author":"Wilson","year":"1972","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0167-8191(05)80143-7_bib41","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/TC.1980.1675651","article-title":"On a class of multistage interconnection networks","volume":"C-29","author":"Wu","year":"1980","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S0167-8191(05)80143-7_bib42","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/TC.1981.1675790","article-title":"The universality of the shuffle-exchanger network","volume":"C-30","author":"Wu","year":"1981","journal-title":"IEEE Trans. Comput"},{"key":"10.1016\/S0167-8191(05)80143-7_bib43","series-title":"Handbook of Pattern Recognition and Image Processing","author":"Young","year":"1986"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819105801437?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819105801437?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T06:26:37Z","timestamp":1548311197000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819105801437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":43,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["S0167819105801437"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(05)80143-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}