Alternatives and similar repositories for petal-neighbors

Users that are interested in petal-neighbors are comparing it to the libraries listed below

• grantslatton / ball-tree
  A ball-tree implementation for K-NN
  ☆17Updated this week
• frjnn / bhtsne
  Parallel Barnes-Hut t-SNE implementation written in Rust.
  ☆89Updated 6 months ago
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆151Updated 3 months ago
• lerouxrgd / ngt-rs
  Rust wrappers for NGT approximate nearest neighbor search
  ☆39Updated last year
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆46Updated 2 weeks ago
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆109Updated 2 years ago
• lakwet / voracious_sort
  Voracious radix sort
  ☆71Updated last month
• petabi / petal-decomposition
  Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)
  ☆20Updated last month
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆102Updated 2 months ago
• code-sam / graphblas_sparse_linear_algebra
  Rust wrapper for SuiteSparse:GraphBLAS
  ☆15Updated last week
• tomtomwombat / hyperloglockless
  Lightning fast concurrent HyperLogLog for Rust.
  ☆44Updated 5 months ago
• diffeo / kodama
  Fast hierarchical agglomerative clustering in Rust.
  ☆104Updated 9 months ago
• valebes / ppl
  Parallelo Parallel Library (PPL) is a small parallel framework that brings Structured Parallel Programming in Rust.
  ☆78Updated 4 months ago
• nnethercott / hannoy
  Production-ready KV-backed HNSW implementation in Rust using LMDB
  ☆66Updated this week
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆127Updated 3 weeks ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆67Updated 3 weeks ago
• tavianator / spliter
  A simple way to implement Rayon's ParallelIterator
  ☆19Updated 3 years ago
• brurucy / indexset
  A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and a…
  ☆105Updated this week
• ritchie46 / lsh-rs
  Locality Sensitive Hashing in Rust with Python bindings
  ☆120Updated 2 years ago
• jean-pierreBoth / hnswlib-rs
  Rust implementation of the HNSW algorithm (Malkov-Yashunin)
  ☆225Updated last month
• seijikun / kmean-rs
  Small and fast library for k-means clustering.
  ☆53Updated 6 months ago
• velvia / compressed-vec
  SIMD Floating point and integer compressed vector library
  ☆80Updated 2 years ago
• rust-cv / hnsw
  HNSW ANN from the paper "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"
  ☆253Updated 5 months ago
• tabac / hyperloglog.rs
  HyperLogLog implementations.
  ☆27Updated last year
• axiomhq / hypertwobits
  HyperTwoBits implementation
  ☆17Updated 4 months ago
• tavianator / acap
  As Close As Possible — nearest neighbor search in Rust
  ☆24Updated 10 months ago
• rust-cv / ndarray-vision
  Computer vision library built on top of ndarray
  ☆71Updated last year
• main-- / rust-intervaltree
  ☆21Updated last year
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆92Updated last year
• rust-cv / nshare
  Provides an interface layer to convert between n-dimensional types in different Rust crates
  ☆56Updated last year