0
3.5kviews
Give the updating buckets approach of DGIM algorithm.
1 Answer
0
171views

Suppose we have a window of length N on a binary stream. We want at all times to be able to answer queries of the form “how many 1’s are there in the last k bits?” for any k≤ N. For this purpose we use the DGIM algorithm.

The basic …

Create a free account to keep reading this post.

and 5 others joined a min ago.

Please log in to add an answer.