-
Ann Arbor Algorithms
- Ann Arbor MI
Stars
Up to 200x Faster Dot Products & Similarity Metrics — for Python, Rust, C, JS, and Swift, supporting f64, f32, f16 real & complex, i8, and bit vectors using SIMD for both AVX2, AVX-512, NEON, SVE, …
A modern header-only library to calculate various statistics on a set of data
A curated list of awesome supply chain blogs, podcasts, standards, projects, and examples.
Evaluation of 3D object detection performance on the KITTI dataset.
Code for 3D object detection for autonomous driving
Custom memory allocators in C++ to improve the performance of dynamic memory allocation
A Python nearest neighbor descent for approximate nearest neighbors
Approximate Nearest Neighbor (ANN) search for high-dimensional data.
jcausey-astate / grt123-DSB2017
Forked from lfz/DSB2017The solution of team 'grt123' in DSB2017
Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...
A very simple, fast, multithreaded, platform independent HTTP and HTTPS server and client library implemented using C++11 and Boost.Asio. Created to be an easy way to make REST resources available …