Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n k for some xed k . Consider the followin - Streaming algorithms - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2015-01-22 08:15:45 Streaming algorithm Theoretical computer science Computational complexity theory Graph coloring Mathematics Algorithms Applied mathematics		Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n/k for some xed k . Consider the followin Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Download Document from Source Website File Size: 74,84 KB Share Document on Facebook