petabi / petal-neighborsLinks
Nearest neighbor search algorithms including a ball tree and a vantage point tree.
☆11Updated 2 months ago
Alternatives and similar repositories for petal-neighbors
Users that are interested in petal-neighbors are comparing it to the libraries listed below
Sorting:
- Parallel Barnes-Hut t-SNE implementation written in Rust.☆87Updated 3 months ago
- Rust wrappers for NGT approximate nearest neighbor search☆39Updated last year
- Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)☆20Updated 6 months ago
- A ball-tree implementation for K-NN☆17Updated last year
- Integer sets as fast, sorted, integer ranges with full set operations☆97Updated last month
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆109Updated 2 years ago
- Parallel iterator processing library for Rust☆103Updated 2 years ago
- Provides an interface layer to convert between n-dimensional types in different Rust crates☆55Updated last year
- Locality Sensitive Hashing in Rust with Python bindings☆119Updated 2 years ago
- Fast hierarchical agglomerative clustering in Rust.☆102Updated 6 months ago
- ResNet implementation with Burn☆35Updated last year
- Succinct data structures using very efficient rank and select☆127Updated 3 months ago
- Rust libraries and programs focused on succinct data structures☆150Updated 3 weeks ago
- Tensor library for machine learning☆26Updated 3 weeks ago
- BLAS source of choice☆43Updated last week
- Hidden Markov Models in Rust☆78Updated last year
- A small and fast FM-Index for Rust☆35Updated this week
- Thread-safe clone-on-write container for fast concurrent writing and reading.☆49Updated 2 years ago
- Scientific and statistical computing with Rust.☆67Updated 3 years ago
- Parallelo Parallel Library (PPL) is a small parallel framework that brings Structured Parallel Programming in Rust.☆78Updated last month
- Kiddo☆133Updated this week
- A trait + derive to recursively compute / print the memory usage of a data structure.☆33Updated 8 months ago
- A vec-backed tree structure with tree-specific generational indexes.☆40Updated last year
- Small and fast library for k-means clustering.☆51Updated 3 months ago
- Computer vision library built on top of ndarray☆70Updated last year
- As Close As Possible — nearest neighbor search in Rust☆23Updated 7 months ago
- VF2 subgraph isomorphism algorithm in Rust.☆65Updated 7 months ago
- Lightning fast concurrent HyperLogLog for Rust.☆42Updated 2 months ago
- Voracious radix sort☆69Updated last year
- Rust LZ4 bindings☆56Updated 9 months ago