Back to Results
First PageMeta Content
Hashing / Search algorithms / Bloom filter / Countmin sketch / Hash table / Hash function / Set / Universal hashing / Filter / RabinKarp algorithm / Feature hashing


CS168: The Modern Algorithmic Toolbox Lecture #2: Approximate Heavy Hitters and the Count-Min Sketch Tim Roughgarden & Gregory Valiant∗ March 30, 2016
Add to Reading List

Document Date: 2016-06-04 09:49:43

Open Document

File Size: 287,25 KB

Share Result on Facebook