Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) = - Streaming algorithms - Document - PDFSEARCH.IO

First Page	Meta Content
	Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) = Add to Reading List Document Date: 2015-01-19 07:51:43 Open Document File Size: 90,30 KB Share Result on Facebook IndustryTerm hypothetical algorithm / eﬀective algorithm / randomized algorithm / deterministic algorithm / streaming algorithm / / Product F22 / / Technology deterministic algorithm / 2 Streaming algorithm / following streaming algorithm / eﬀective algorithm / randomized algorithm / streaming algorithm / hypothetical algorithm / / SocialTag Analysis of algorithms Probabilistic complexity theory Randomized algorithm

Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) =Add to Reading List