- Is there a compression algorithm for an array of integers (lossless or lossy) that allows you to modify the array without having to uncompress the whole thing? I want to keep a compressed Count-Min sketch in memory without having to decompress it all to add or remove elements. https://sites.google.com/site/countminsketch/ 6 comments programming
Linking pages
- Counting Efficiently with Bounter pt. 2: CountMinSketch | RARE Technologies https://rare-technologies.com/counting-efficiently-with-bounter-pt-2-countminsketch/ 8 comments
- A collection of links for streaming algorithms and data structures · GitHub https://gist.github.com/debasishg/8172796 3 comments
Related searches:
Search whole site: site:sites.google.com
Search title: Count-Min Sketch
See how to search.