TiMBL implements several memory-based learning algorithms.
-
Updated
Dec 16, 2024 - C++
TiMBL implements several memory-based learning algorithms.
Feature Tracking and testing of various keypoint detector/descriptor combinations, keypoint matching using Brute Force and FLANN approach.
Implementation of Iterative Closest Point and Trimmed Iterative Closest Point algorithms.
Database Management Systems course projects
A powerful and rapid data interpolator.
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.
This repository contains a collection of machine learning and deep learning algorithms I implemented from scratch using Python and C++.
Database Management Systems course projects
Parallel k-nearest neighbor algorithm using c++ threads
N₂O - Approximate Nearest Neighbor Search Library (Hard fork of https://github.com/kakao/n2)
K Nearest Neighbours Implemented in C++
A Simple k-nearest neighbors implementation in C++
CS480F at Binghamton University with Dr. Ken Chiu
South African Coin Recognition System using multiple feature extraction techniques and classifiers
Simple KNN implementation
Implementation of clustering algorithms and optimizations in C++. Benchmarked on the MNIST handwritten digit dataset
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."