In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more
-
Updated
Feb 17, 2024 - Python
#
count-min-sketch
Here are 9 public repositories matching this topic...
Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
python
data-science
data-mining
datastructures
probability
bloom-filter
bitarray
data-structures
data-analysis
count-min-sketch
probabilistic-programming
cuckoo-filter
counting-bloom-filter
count-mean-min-sketch
counting-cuckoo-filter
count-mean-sketch
heavy-hitters
stream-threshold
quotient-filter
-
Updated
Oct 31, 2024 - Python
Pond is a high performance object-pooling library for Python
-
Updated
Mar 1, 2024 - Python
A compressed adaptive optimizer for training large-scale deep learning models using PyTorch
hashing
deep-learning
neural-network
pytorch
transformer
imagenet
count-min-sketch
language-model
adagrad
adam-optimizer
sgd-optimizer
count-sketch
sgd-momentum
-
Updated
Nov 26, 2019 - Python
Implementation and experimental tests of various algorithms.
-
Updated
Sep 9, 2020 - Python
Vanilla python implementation of the K- Heavy Hitters algorithm (data-structure)
-
Updated
Nov 28, 2017 - Python
The project aims to find the trend by extracting and analyzing top k words in real-time posts of Twitter.
-
Updated
May 1, 2023 - Python
Data Pipelines and Sketchy Data Structures for Sub-Linear Retrievals
-
Updated
Oct 6, 2019 - Python
Improve this page
Add a description, image, and links to the count-min-sketch topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the count-min-sketch topic, visit your repo's landing page and select "manage topics."