TiMBL implements several memory-based learning algorithms.
-
Updated
Sep 27, 2024 - C++
TiMBL implements several memory-based learning algorithms.
Implementation of Iterative Closest Point and Trimmed Iterative Closest Point algorithms.
N₂O - Approximate Nearest Neighbor Search Library (Hard fork of https://github.com/kakao/n2)
Parallel k-nearest neighbor algorithm using c++ threads
A Simple k-nearest neighbors implementation in C++
Feature Tracking and testing of various keypoint detector/descriptor combinations, keypoint matching using Brute Force and FLANN approach.
Database Management Systems course projects
CS480F at Binghamton University with Dr. Ken Chiu
A powerful and rapid data interpolator.
K Nearest Neighbours Implemented in C++
Database Management Systems course projects
Implementation of clustering algorithms and optimizations in C++. Benchmarked on the MNIST handwritten digit dataset
South African Coin Recognition System using multiple feature extraction techniques and classifiers
Simple KNN implementation
Implementation and survey of similarity search methods that rely on dimensionality reduction (e.g. LSH), D-dimensional vector clustering
A university project implementing Vamana-Indexing-Algorithm (VIA) for Approximate-Nearest-Neighbors (ANN) problem.
An example of multiple kernel in C++ for SDAccel, compiled by Makefile
Add a description, image, and links to the k-nearest-neighbours topic page so that developers can more easily learn about it.
To associate your repository with the k-nearest-neighbours topic, visit your repo's landing page and select "manage topics."