{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:13:34Z","timestamp":1763968414730,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,10]]},"DOI":"10.1109\/bigdata50022.2020.9378426","type":"proceedings-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T17:10:21Z","timestamp":1616173821000},"page":"5172-5181","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Nearest-Neighbour Fields via Massively-Parallel Propagation-Assisted K-D Trees"],"prefix":"10.1109","author":[{"given":"Cosmin Eugen","family":"Oancea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ties","family":"Robroek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Gieseke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36036-7_5"},{"key":"ref32","first-page":"119","article-title":"Parametric Polymorphism for Computer Algebra Software Components","author":"chicha","year":"2004","journal-title":"Procs 6th Int Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2975991.2975997"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3236792"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89740-8_11"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390170"},{"key":"ref11","first-page":"1337","article-title":"Deep learning with COTS HPC systems","author":"coates","year":"2013","journal-title":"Procs of the 30th Int Conference on Machine Learning"},{"key":"ref12","first-page":"172","article-title":"Buffer k-d trees: Processing massive nearest neighbor queries on GPUs","volume":"32","author":"gieseke","year":"2014","journal-title":"Proceedings of the 31st International Conference on Machine Learning ser JMLR W&CP"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.35"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01064.x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409079"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/RT.2006.280216"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1230100.1230129"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2010.5654017"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2094002"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.459"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531330"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1542431.1542434"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.38"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2477814"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295707"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref7","first-page":"111","article-title":"Computing nearest-neighbor fields via propagation- assisted kd-trees","author":"he","year":"2012","journal-title":"2012 IEEE Conference on Computer Vision and Pattern Recognition"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459271"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2004.1315022"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/11758549_30"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.45"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408667"},{"key":"ref24","first-page":"291","article-title":"Parallel k-nearest neighbor search on graphics hardware","author":"wang","year":"2010","journal-title":"Procs of 3rd International Symposium on Parallel Architectures Algorithms and Programming"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04667-4_20"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2011.01.006"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40942-4_8"}],"event":{"name":"2020 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2020,12,10]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2020,12,13]]}},"container-title":["2020 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9377717\/9377728\/09378426.pdf?arnumber=9378426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T11:47:24Z","timestamp":1656330444000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9378426\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,10]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/bigdata50022.2020.9378426","relation":{},"subject":[],"published":{"date-parts":[[2020,12,10]]}}}