Alternatives and similar repositories for petal-neighbors

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

• frjnn / bhtsne
  Parallel Barnes-Hut t-SNE implementation written in Rust.
  ☆87Updated 3 months 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
• grantslatton / ball-tree
  A ball-tree implementation for K-NN
  ☆17Updated last year
• diffeo / kodama
  Fast hierarchical agglomerative clustering in Rust.
  ☆102Updated 6 months ago
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆127Updated last week
• ralfbiedert / ffsvm
  FFSVM stands for "Really Fast Support Vector Machine"
  ☆77Updated 10 months ago
• lerouxrgd / ngt-rs
  Rust wrappers for NGT approximate nearest neighbor search
  ☆39Updated last year
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆99Updated last week
• ritchie46 / lsh-rs
  Locality Sensitive Hashing in Rust with Python bindings
  ☆119Updated 2 years ago
• petabi / petal-decomposition
  Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)
  ☆20Updated 2 weeks ago
• tavianator / spliter
  A simple way to implement Rayon's ParallelIterator
  ☆18Updated 3 years ago
• dpc / pariter
  Parallel iterator processing library for Rust
  ☆103Updated 2 years ago
• rust-cv / ndarray-vision
  Computer vision library built on top of ndarray
  ☆70Updated last year
• axiomhq / hypertwobits
  HyperTwoBits implementation
  ☆15Updated 2 months ago
• sdd / kiddo
  Kiddo
  ☆135Updated this week
• blas-lapack-rs / blas-src
  BLAS source of choice
  ☆43Updated 3 weeks ago
• al-jshen / compute
  Scientific and statistical computing with Rust.
  ☆67Updated 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…
  ☆103Updated 3 months ago
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆150Updated last month
• iwburns / slab-tree
  A vec-backed tree structure with tree-specific generational indexes.
  ☆40Updated last year
• Zestors / zestors
  ☆113Updated 2 years ago
• rust-cv / nshare
  Provides an interface layer to convert between n-dimensional types in different Rust crates
  ☆55Updated last year
• rust-cv / hnsw
  HNSW ANN from the paper "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"
  ☆246Updated 2 months ago
• valebes / ppl
  Parallelo Parallel Library (PPL) is a small parallel framework that brings Structured Parallel Programming in Rust.
  ☆78Updated last month
• jean-pierreBoth / hnswlib-rs
  Rust implementation of the HNSW algorithm (Malkov-Yashunin)
  ☆216Updated last month
• paulkernfeld / hmmm
  Hidden Markov Models in Rust
  ☆78Updated last year
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆46Updated last month
• feldroop / genedex
  A small and fast FM-Index for Rust
  ☆38Updated last week
• Enet4 / faiss-rs
  Rust language bindings for Faiss
  ☆240Updated last month
• zommiommy / mem_dbg-rs
  A trait + derive to recursively compute / print the memory usage of a data structure.
  ☆36Updated 2 weeks ago