Bigger Buffer k-d Trees on Multi-Many-Core Systems

9 Dec 2015 • Fabian Gieseke • Cosmin Eugen Oancea • Ashish Mahabal • Christian Igel • Tom Heskes

A buffer k-d tree is a k-d tree variant for massively-parallel nearest neighbor search. While providing valuable speed-ups on modern many-core devices in case both a large number of reference and query points are given, buffer k-d trees are limited by the amount of points that can fit on a single device... (read more)

PDF Abstract

Results from the Paper

Add Remove

Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

METHOD	TYPE
🤖 No Methods Found	Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet

Bigger Buffer k-d Trees on Multi-Many-Core Systems

Code

Add Remove Mark official

Tasks

Add Remove

Datasets

Results from the Paper

Add Remove

Methods used in the Paper

Add Remove

Edit Social Preview

Bigger Buffer k-d Trees on Multi-Many-Core Systems Edit social preview

Code Edit Add Remove Mark official

Tasks Edit Add Remove

Datasets Edit

Results from the Paper Edit Add Remove

Methods used in the Paper Edit Add Remove

Bigger Buffer k-d Trees on Multi-Many-Core Systems

Code

Add Remove Mark official

Tasks

Add Remove

Datasets

Results from the Paper

Add Remove

Methods used in the Paper

Add Remove