7 Questions 8 Answers 0 Followers
Questions related from Zubair Shah
Space Saving algorithm is an approximation algorithm for approximating frequencies of items in data stream. Suppose a continues stream of elements [$e_1,e_1,e_2,e_1,e_5,e_3....$], Space Saving...
12 December 2015 8,690 0 View
I read this article [1] and found an interesting algorithm Space Saving (SS) for finding Top-K and frequent items or heavy hitters. The authors described a data structure called Stream summary....
08 August 2015 8,043 4 View
I believe that RG is a great place for promoting your research, interacting with diverse research community and knowing about others' research. However, recently I found a discussion on RG that...
08 August 2015 652 2 View
Let say a value N >> 1 is distributed among m>1 members, which can follow some distribution (Binomial or Gaussian). Is there any generic term to represent the multiplication of the...
04 April 2015 6,561 5 View
I have been looking for implementation of Deterministic wave introduced by Gibbons et al.[1]. This a useful algorithm for computing many important information over data streams in sliding window....
02 February 2015 1,191 0 View
Can any one explains to me that what is the update cost of Lossy counting per element.
12 December 2014 415 2 View
Count-min sketch is very influential and is wonderful invention by Graham Cormode and Muthukrishnan. It has many application, one of which is finding the most frequent items in data streams. I...
08 August 2014 4,124 5 View
