{"id":"https://openalex.org/W1856829162","doi":"https://doi.org/10.1109/asap.1994.331788","title":"A scalable bit-sequential SIMD array for nearest-neighbor classification using the city-block metric","display_name":"A scalable bit-sequential SIMD array for nearest-neighbor classification using the city-block metric","publication_year":2002,"publication_date":"2002-12-17","ids":{"openalex":"https://openalex.org/W1856829162","doi":"https://doi.org/10.1109/asap.1994.331788","mag":"1856829162"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/asap.1994.331788","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073251770","display_name":"Martin Neschen","orcid":null},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"funder","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"M. Neschen","raw_affiliation_strings":["Lab. d'Inf., Ecole Polytech., Palaiseau, France"],"affiliations":[{"raw_affiliation_string":"Lab. d'Inf., Ecole Polytech., Palaiseau, France","institution_ids":["https://openalex.org/I142476485"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073251770"],"corresponding_institution_ids":["https://openalex.org/I142476485"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":57},"biblio":{"volume":null,"issue":null,"first_page":"369","last_page":"380"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.9978,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9963,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.8602925},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.43418223}],"concepts":[{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.8602925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.74766594},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6980698},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.66136134},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5586364},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.48627174},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4572501},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.45648596},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.43418223},{"id":"https://openalex.org/C53442348","wikidata":"https://www.wikidata.org/wiki/Q745101","display_name":"Content-addressable memory","level":3,"score":0.43111822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40491688},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3294229},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18558252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16478708},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.124233514},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.11982283},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/asap.1994.331788","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.84,"id":"https://metadata.un.org/sdg/11"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":6,"referenced_works":["https://openalex.org/W2122111042","https://openalex.org/W2142248489","https://openalex.org/W2150593711","https://openalex.org/W2800394774","https://openalex.org/W3017143921","https://openalex.org/W4210451417"],"related_works":["https://openalex.org/W4311812695","https://openalex.org/W4242015792","https://openalex.org/W2534771569","https://openalex.org/W2394097730","https://openalex.org/W2291920536","https://openalex.org/W2164535554","https://openalex.org/W2117788426","https://openalex.org/W2037547261","https://openalex.org/W2022544890","https://openalex.org/W1993644742"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,9,31,49,85],"fully":[3],"scalable":[4],"SIMD":[5],"array":[6,56],"architecture":[7],"for":[8,30],"most":[10],"efficient":[11],"implementation":[12],"of":[13,34,42,64,84,94],"pattern":[14],"classification":[15],"by":[16],"nearest-neighbor":[17],"algorithms":[18],"using":[19],"the":[20,65,68,82,88],"city-block":[21],"metric.":[22],"The":[23],"elementary":[24],"accumulator":[25],"cell":[26],"is":[27],"highly":[28],"optimized":[29],"sequential":[32],"accumulation":[33],"absolute":[35],"integer":[36],"differences,":[37],"so":[38],"that":[39],"several":[40],"hundreds":[41],"them":[43],"can":[44],"be":[45],"easily":[46],"integrated":[47],"on":[48],"single":[50],"chip.":[51],"A":[52],"two-dimensional":[53],"M/spl":[54],"times/N":[55],"structure,":[57,87],"reflecting":[58],"an":[59],"inherent":[60],"two-fold":[61],"data":[62,69],"parallelism":[63],"applications,":[66],"reduces":[67],"transfer":[70],"to":[71,77],"off-chip":[72],"memory":[73],"from":[74],"O(M/spl":[75],"times/N)":[76],"O(M+N).":[78],"Here,":[79],"we":[80],"discuss":[81],"realization":[83],"VLSI":[86],"system":[89],"architecture,":[90],"and":[91],"large":[92],"networks":[93],"associative":[95],"blocks":[96],"as":[97],"possible":[98],"applications.<":[99],">":[102]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1856829162","counts_by_year":[],"updated_date":"2025-01-31T18:39:26.855539","created_date":"2016-06-24"}