Interface class for searching for nearest neighbors, of a set of queries, in the Random Ball Cover
data structure.
More...
#include <algorithms.hpp>
Interface class for searching for nearest neighbors, of a set of queries, in the Random Ball Cover
data structure.
The process involves finding the representative of each query and then searching in their representative's list for their NN. The algorithm is the one described in the one shot algorithm. For more details, see [here][http://www.lcayton.com/rbc.pdf].
kernels/rbc_kernels.cl
, kernels/reduce_kernels.cl
and kernels/scan_kernels.cl
. K | configures the class for using one of the available kernels for computing the Q-R distances. |
P | configures the class for using one of the available kernels for the database permutation. |
S | configures the class for using one of the available kernels for computing the Q-X[L] distances. |