{"id":"https://openalex.org/W2061163991","doi":"https://doi.org/10.1142/s0129054103001601","title":"SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES","display_name":"SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES","publication_year":2003,"publication_date":"2003-02-01","ids":{"openalex":"https://openalex.org/W2061163991","doi":"https://doi.org/10.1142/s0129054103001601","mag":"2061163991"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054103001601","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103001601","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"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/A5100890872","display_name":"Chin-Hsiung Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I2800697491","display_name":"Republic of China Naval Academy","ror":"https://ror.org/01megcb21","country_code":"TW","type":"government","lineage":["https://openalex.org/I2800697491"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"CHIN-HSIUNG WU","raw_affiliation_strings":["Department of Information Management, Chinese Naval Academy, Kaohsiung, Taiwan, R. 0. C"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Management, Chinese Naval Academy, Kaohsiung, Taiwan, R. 0. C","institution_ids":["https://openalex.org/I2800697491"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038219098","display_name":"Shi\u2010Jinn Horng","orcid":"https://orcid.org/0000-0002-9978-0400"},"institutions":[{"id":"https://openalex.org/I154864474","display_name":"National Taiwan University of Science and Technology","ror":"https://ror.org/00q09pe49","country_code":"TW","type":"education","lineage":["https://openalex.org/I154864474"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"SHI-JINN HORNG","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, R. 0. C"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, R. 0. C","institution_ids":["https://openalex.org/I154864474"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15035301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"01","first_page":"79","last_page":"98"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6471613049507141},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6444950103759766},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5802707672119141},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5389953255653381},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.48844805359840393},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.44576868414878845},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43899211287498474},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4385090470314026},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4190349280834198},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3187621831893921},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28518781065940857}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6471613049507141},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6444950103759766},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5802707672119141},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5389953255653381},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.48844805359840393},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.44576868414878845},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43899211287498474},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4385090470314026},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4190349280834198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3187621831893921},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28518781065940857},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054103001601","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103001601","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1976434221","https://openalex.org/W1984162151","https://openalex.org/W1992266592","https://openalex.org/W1994418893","https://openalex.org/W1997605021","https://openalex.org/W2012750181","https://openalex.org/W2030267467","https://openalex.org/W2034553789","https://openalex.org/W2052565631","https://openalex.org/W2062585124","https://openalex.org/W2088776034","https://openalex.org/W2090924101","https://openalex.org/W2101670722","https://openalex.org/W2120549419","https://openalex.org/W2123637527","https://openalex.org/W2132215016","https://openalex.org/W2145830737","https://openalex.org/W2160084563","https://openalex.org/W2166859133","https://openalex.org/W2167896749","https://openalex.org/W2171753269","https://openalex.org/W2171900452"],"related_works":["https://openalex.org/W2499279132","https://openalex.org/W1974690493","https://openalex.org/W2607998022","https://openalex.org/W2059382600","https://openalex.org/W1951582625","https://openalex.org/W4377371889","https://openalex.org/W125830805","https://openalex.org/W2377400264","https://openalex.org/W2005006850","https://openalex.org/W2113623403"],"abstract_inverted_index":{"The":[0,28,200],"computational":[1],"model":[2],"on":[3,50,94,113,212,235],"which":[4,226],"the":[5,10,19,51,68,71,74,173,217],"algorithms":[6,44,102,203,225],"are":[7,34,76,106,223],"developed":[8],"is":[9],"array":[11,238],"with":[12,45],"reconfigurable":[13],"optical":[14,23],"buses":[15],"(AROB).":[16],"It":[17],"integrates":[18],"advantages":[20],"of":[21,31,48,70,111,219],"both":[22],"transmission":[24],"and":[25,61,73,90,100,172],"electronic":[26],"computation.":[27],"main":[29],"contributions":[30],"this":[32,229,233],"paper":[33],"in":[35,137,149,176,209],"designing":[36],"several":[37,84],"optimal":[38,40],"and/or":[39],"speed-up":[41],"template":[42,75,104],"matching":[43,105],"varying":[46],"degrees":[47],"parallelism":[49],"AROB":[52],"model.":[53],"For":[54,120],"an":[55,62],"N":[56,58],"\u00d7":[57,64,144,160,166,168,187,193,195],"digitized":[59],"image":[60,72],"M":[63,65,130,163,190],"template,":[66],"when":[67],"domains":[69],"O(":[77],"log":[78,162,169,189,196],"N)-bit":[79],"integers,":[80],"we":[81],"first":[82],"design":[83],"basic":[85,96],"operations":[86],"for":[87,103,232],"window":[88],"broadcasting":[89],"rotation.":[91],"Then":[92],"based":[93],"these":[95],"operations,":[97],"three":[98],"efficient":[99],"scalable":[101],"derived":[107],"using":[108,142,158,185],"various":[109],"numbers":[110],"processors":[112],"a":[114,213,236],"two-dimensional":[115],"(2-D)":[116],"or":[117],"3-D":[118],"AROB.":[119,215],"1":[121,126],"\u2264":[122,124,127,129,131,133],"r":[123,143,145],"N,":[125,134],"p":[128],"q":[132],"one":[135],"runs":[136,148,175],"[Formula:":[138,150,154,177,181],"see":[139,151,155,178,182],"text]":[140,179],"time":[141,157,184,211,230],"processors,":[146,171,198],"another":[147],"text],":[152],"(resp.":[153,164,180],"text])":[156,183],"pN":[159,165,167],"pN/":[161],"N)":[170,197],"other":[174],"pq":[186,192],"pq/":[188],"(or":[191],"pqN":[194],"respectively.":[199],"latter":[201],"two":[202],"can":[204,227],"be":[205],"tuned":[206],"to":[207],"run":[208],"O(1)":[210],"2-D":[214,237],"To":[216],"best":[218],"our":[220],"knowledge,":[221],"there":[222],"no":[224],"reach":[228],"complexity":[231],"problem":[234],"architecture.":[239]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}