Hashing and heavy hitters
Kent Quanrud · 76:10
This lecture introduces universal hashing and the Count-Min sketch so you can estimate every item’s frequency in a huge stream (and recover ε-heavy hitters) in sublinear space: allocate about \(10/\varepsilon\) counte...