count-min-sketch
Here are 47 public repositories matching this topic...
An implementation of Count-Min Sketch in Golang
-
Updated
May 19, 2016 - Go
Spark with probabilistic algortighmts - Bloom filter, HLL, QTree and Count-min sketch
-
Updated
Aug 24, 2017 - Scala
Count-Min Sketch
-
Updated
Aug 25, 2017 - Go
-
Updated
Nov 9, 2017 - Jupyter Notebook
Vanilla python implementation of the K- Heavy Hitters algorithm (data-structure)
-
Updated
Nov 28, 2017 - Python
Collection of code covering various topics in Machine Learning
-
Updated
Dec 16, 2017 - Jupyter Notebook
CountMin sketching algorithm in golang
-
Updated
Jul 26, 2018 - Go
-
Updated
Apr 22, 2019 - C++
PoC (Proof of Concept) caching optimization algorithm for graphical tree environment, written entirely in pure C++.
-
Updated
Sep 23, 2019 - C++
Data Pipelines and Sketchy Data Structures for Sub-Linear Retrievals
-
Updated
Oct 6, 2019 - Python
A compressed adaptive optimizer for training large-scale deep learning models using PyTorch
-
Updated
Nov 26, 2019 - Python
an implementation of Count-Min Sketch, an approximate counting data structure for summarizing data streams, in golang
-
Updated
Dec 30, 2019 - Go
This repository contains a collection of three Data Engineering capstone projects made for the DTU Data Engineering course 02807: Computational Tools for Data Science
-
Updated
Jan 12, 2020 - Jupyter Notebook
-
Updated
Jun 7, 2020 - Java
Implementation and experimental tests of various algorithms.
-
Updated
Sep 9, 2020 - Python
Collection of sketching algorithms in Swift
-
Updated
Sep 27, 2020 - Swift
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."