checkOpenMP

Implements methods to perform fast approximate K-nearest neighbor search on input matrix. Algorithm based on the 'N2' implementation of an approximate nearest neighbor search using hierarchical  Navigable Small World (NSW) graphs. The original algorithm is described in "Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs", Y. Malkov and D. Yashunin, <doi:10.1109/TPAMI.2018.2889473>, <arXiv:1603.09320>.

Evan Biederstedt

Fast and Scalable Approximate k-Nearest Neighbor Search Methods
using 'N2' Library

Peter Kharchenko

checkOpenMP: boolean to check OpenMP exists

Description

Usage

Arguments