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 11 months ago
• frjnn / bhtsne
  Parallel Barnes-Hut t-SNE implementation written in Rust.
  ☆87Updated 2 months ago
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆108Updated 2 years ago
• lerouxrgd / ngt-rs
  Rust wrappers for NGT approximate nearest neighbor search
  ☆38Updated last year
• jean-pierreBoth / hnswlib-rs
  Rust implementation of the HNSW algorithm (Malkov-Yashunin)
  ☆206Updated last week
• petabi / petal-decomposition
  Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)
  ☆20Updated 5 months ago
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆149Updated last week
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆94Updated last month
• sarah-quinones / pulp
  ☆276Updated last week
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆126Updated 2 months ago
• axiomhq / hypertwobits
  HyperTwoBits implementation
  ☆14Updated 3 weeks ago
• valebes / ppl
  Parallelo Parallel Library (PPL) is a small parallel framework that brings Structured Parallel Programming in Rust.
  ☆77Updated 2 weeks ago
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆46Updated this week
• ritchie46 / lsh-rs
  Locality Sensitive Hashing in Rust with Python bindings
  ☆118Updated 2 years ago
• andybarron / tokio-rayon
  Mix async code with CPU-heavy thread pools using Tokio + Rayon
  ☆144Updated 2 years ago
• vigna / epserde-rs
  An ε-copy serialization/deserialization framework for Rust
  ☆155Updated this week
• diffeo / kodama
  Fast hierarchical agglomerative clustering in Rust.
  ☆102Updated 5 months ago
• dpc / pariter
  Parallel iterator processing library for Rust
  ☆103Updated 2 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…
  ☆102Updated last month
• Zestors / zestors
  ☆113Updated 2 years ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆59Updated this week
• tomtomwombat / fastbloom
  The fastest Bloom filter in Rust. No accuracy compromises. Full concurrency support and compatible with any hasher.
  ☆285Updated last week
• alecmocatta / serde_closure
  Serialisable closures for Rust.
  ☆65Updated 2 years ago
• paulkernfeld / hmmm
  Hidden Markov Models in Rust
  ☆78Updated last year
• zommiommy / mem_dbg-rs
  A trait + derive to recursively compute / print the memory usage of a data structure.
  ☆33Updated 7 months ago
• tomtomwombat / hyperloglockless
  Lightning fast concurrent HyperLogLog for Rust.
  ☆41Updated last month
• rust-cv / hnsw
  HNSW ANN from the paper "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"
  ☆242Updated last month
• 10XGenomics / lz4-rs
  Rust LZ4 bindings
  ☆53Updated 8 months ago
• psvri / arrow-gpu
  WIP GPU implmentation of apache arrow written in rust.
  ☆30Updated 2 weeks ago
• stalwartlabs / hashify
  Perfect hashing for an imperfect world
  ☆93Updated 2 weeks ago