nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees
-
Updated
Apr 22, 2024 - C++
nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees
Absolute balanced kdtree for fast kNN search.
CUDA based Iterative Closest Point Algorithm Implementation
Built text and image clustering models using unsupervised machine learning algorithms such as nearest neighbors, k means, LDA , and used techniques such as expectation maximization, locality sensitive hashing, and gibbs sampling in Python
Scalable Nearest Neighbor Algorithms for High Dimensional Data
Policy Iteration for Continuous Dynamics
An efficient Nearest Neighbor Classifier for the MINST dataset. It uses a VP Tree data structure for preprocessing, thus improving query time complexity
Header-only C++ K-d tree library
Answers to assignments for Princeton University Algorithm Course
Containing all the coding projects and assignments I've completed in COS 226 @ Princeton (Data Structures & Algorithms)