Ask a New Question

Question

Suppose we are executing the DGIM algorithm for approximate counting of bits in a stream. Let the window size be 1000.

(a) What is the largest possible bucket size in the representation of this stream?


(b) Suppose each of the last 1000 bits is 1. What is the smallest possible size of the largest bucket in the representation of the window?
6 years ago

Answers

rouba
256
4 years ago

Related Questions

An object is executing circular orbits of radius 0.5 m. If it completes an orbit every 3 seconds, wh... an athlete executing a long jump leaves the ground at a 28 degree angle and lands 7.6 m away. pa... An athlete executing a long jump leaves the ground at a 28.0 angle and lands 7.60m away. part a)Wh... A body is executing s.h.m. of amplitude 1m .Its velocity while passing through the mean position is... A pendulum bob executing SHM has 2cm and 12HZ as amplitude and frequency respectively. Calculate the... #1.Algorithms for Executing query 1.External sorting 2.Sort strategy 3. Merge strategy #2.Algor... 1. Algorithms for Executing query 2.External sorting 3. Sort strategy 4. Merge strategy 5.Algor... Algorithms for Executing query 1. Algorithms for Executing query A.External sorting B.Sort strategy C. Merge strategy 2. Algori... #.1Algorithms for Executing 1.External query 2.sorting Sort strategy 3.Merge strategy #2.Algori...
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use