Asked by Nate
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?
(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?
Answers
Answered by
rouba
256
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.