cl_algo::RBC::RBCSearch< K, P, S > Class Template Reference

Interface class for searching for nearest neighbors, of a set of queries, in the Random Ball Cover data structure. More...

#include <algorithms.hpp>

Detailed Description

template<KernelTypeC K, RBCPermuteConfig P, KernelTypeS S>
class cl_algo::RBC::RBCSearch< K, P, S >

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].

Note

The kernels used in this process are available in kernels/rbc_kernels.cl, kernels/reduce_kernels.cl and kernels/scan_kernels.cl.

This is just a declaration. Look at the explicit template specializations for specific instantiations of the class.

Template Parameters

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.

---

The documentation for this class was generated from the following file:

• algorithms.hpp