Approximate Nearest-Neighbour Fields via Massively-Parallel Propagation-Assisted K-D Trees
Keywords
high-performance computing; parallel computing; nearest neighbors fields
Cite as
Oancea, C. E., Robroek, T., & Gieseke, F. (2020). Approximate Nearest-Neighbour Fields via Massively-Parallel Propagation-Assisted K-D Trees. In Wu, X., Jermaine, C., Xiong, L., Hu, X., Kotevska, O., Lu, S., Xu, W., Aluru, S., Zhai, C., Eyhab, A.-}. C., Chen, Z., & Saltz, J. (Eds.), 2020 {IEEE} International Conference on Big Data {(IEEE} BigData 2020 (pp. 5172–5181). Atlanta, GA, USA: IEEE.Details
Publication type
Research article in proceedings (conference)
Peer reviewed
Yes
Publication status
Published
Year
2020
Conference
IEEE Big Data, MLBD Special Session
Venue
Atlanta, GA
Book title
2020 {IEEE} International Conference on Big Data {(IEEE} BigData 2020
Editor
Wu, Xintao; Jermaine, Chris; Xiong, Li; Hu, Xiaohua; Kotevska, Olivera; Lu, Siyuan; Xu, Weija; Aluru, Srinivas; Zhai, Chengxiang; Eyhab Al{-}Masri, Chen; Chen, Zhiyuan; Saltz, Jeff
Start page
5172
End page
5181
Publisher
IEEE
Place
Atlanta, GA, USA
Language
English
DOI