Alternatives and similar repositories for CoverTree

Users that are interested in CoverTree are comparing it to the libraries listed below

• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• bmcfee / spatialtree
  Python module for spatial trees
  ☆37Updated 8 years ago
• vioshyvo / mrpt
  Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search
  ☆263Updated 3 months ago
• ejaasaari / mrpt-comparison
  Performance comparison of the MRPT algorithm to other approximate nearest neighbor search libraries
  ☆27Updated 7 years ago
• michaelchughes / KMeansRex
  Fast, vectorized C++ implementation of K-Means using the Eigen matrix template library. Includes Matlab and Python interfaces.
  ☆57Updated 8 years ago
• stan-dev / nomad
  Fast autodiff.
  ☆19Updated 10 years ago
• una-dinosauria / local-search-quantization
  State-of-the-art method for large-scale ANN search as of Oct 2016. Presented at ECCV 16.
  ☆75Updated 7 years ago
• arbabenko / MultiIndex
  Research code implementing inverted multiindex structure
  ☆83Updated 11 years ago
• lisitsyn / tapkee
  A flexible and efficient С++ template library for dimension reduction
  ☆234Updated last year
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• ZigaSajovic / dCpp
  Automatic differentiation in C++; infinite differentiability of conditionals, loops, recursion and all things C++
  ☆151Updated 6 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 3 months ago
• ryanrhymes / panns
  Python Approximate Nearest Neighbor Search in very high dimensional spaces with optimised indexing.
  ☆214Updated 3 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• DNCrane / Cover-Tree
  A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion a…
  ☆62Updated 7 years ago
• idiap / eakmeans
  Implementation of fast exact k-means algorithms
  ☆45Updated 5 years ago
• amplab / cyclades
  Cyclades
  ☆28Updated 7 years ago
• mloskot / spatial_index_benchmark
  Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…
  ☆47Updated 5 years ago
• fmder / ghalton
  Quasi Random Number Generator
  ☆49Updated 4 years ago
• classner / fertilized-forests
  Repository for the fertilized forests project.
  ☆35Updated 5 years ago
• xdata-skylark / libskylark
  Sketching-based Distributed Matrix Computations for Machine Learning
  ☆100Updated 7 years ago
• google / deepboost
  ☆154Updated 8 years ago
• yaolubrain / DOSNES
  Doubly Stochastic Neighbor Embedding on Spheres
  ☆59Updated 5 years ago
• YahooArchive / Optimal-LSH
  This package provides an efficient implementation of locality-sensitve hashing (LSH)
  ☆153Updated 13 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• cgtuebingen / Product-Quantization-Tree
  GPU-based large scale Approx. Nearest Neighbor Search, accepted at CVPR 2016
  ☆92Updated 6 years ago
• patvarilly / CoverTree
  Python implementation of cover trees, near-drop-in replacement for scipy.spatial.kdtree
  ☆33Updated 13 years ago
• bobye / d2suite
  A C++ package for discrete distribution based large-scale data processing framework
  ☆2Updated 7 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆95Updated 5 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 6 years ago