{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:00:27Z","timestamp":1729652427158,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1109\/fpl.2012.6339247","type":"proceedings-article","created":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T21:47:45Z","timestamp":1351288065000},"page":"99-104","source":"Crossref","is-referenced-by-count":13,"title":["Parallel FPGA-based all pairs shortest paths for sparse networks: A human brain connectome case study"],"prefix":"10.1109","author":[{"given":"Brahim","family":"Betkaoui","sequence":"first","affiliation":[]},{"given":"Yu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"David B.","family":"Thomas","sequence":"additional","affiliation":[]},{"given":"Wayne","family":"Luk","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2010.135"},{"journal-title":"NITRC The Source of Neuroimaging Tools and Resources","year":"0","key":"17"},{"key":"18","article-title":"A heterogeneous accelerator platform for multisubject voxel-based brain network analysis","author":"wang","year":"2011","journal-title":"ICCAD"},{"journal-title":"Searching for A Parent Instead of Fighting over Children A Fast Breadth-First Search Implementation for Graph500","year":"2011","author":"beamer","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"13","article-title":"HAGAR: Efficient multicontext graph processors","author":"mencer","year":"2002","journal-title":"FPL"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2006.45"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TENCON.2009.5396155"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0005226"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2010.5681757"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2009.12.002"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC.2011.28"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"bellman","year":"1958","journal-title":"Quarterly of Applied Mathematics"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639347"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E92.D.1225"}],"event":{"name":"2012 22nd International Conference on Field Programmable Logic and Applications (FPL)","start":{"date-parts":[[2012,8,29]]},"location":"Oslo, Norway","end":{"date-parts":[[2012,8,31]]}},"container-title":["22nd International Conference on Field Programmable Logic and Applications (FPL)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6330714\/6339128\/06339247.pdf?arnumber=6339247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T01:48:23Z","timestamp":1562291303000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6339247\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/fpl.2012.6339247","relation":{},"subject":[],"published":{"date-parts":[[2012,8]]}}}