Applying approximate counting for computing the frequency moments of long data streams (Q2272207): Difference between revisions

@@ Property / cites work @@
+The space complexity of approximating the frequency moments
+Normal rank
@@ Property / cites work @@
+An information statistics approach to data stream and communication complexity
+Normal rank
@@ Property / cites work @@
+Simpler algorithm for estimating frequency moments of data streams
+Normal rank
@@ Property / cites work @@
+Q5501253
@@ Property / cites work: Q5501253 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023085
@@ Property / cites work: Q4023085 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate counting: a detailed analysis
@@ Property / cites work: Approximate counting: a detailed analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Optimal approximations of the frequency moments of data streams
+Normal rank
@@ Property / cites work @@
+Counting large numbers of events in small registers
+Normal rank
@@ Property / cites work @@
+Q3425115
@@ Property / cites work: Q3425115 / rank @@
+Normal rank
@@ Property / cites work @@
+Random sampling with a reservoir
@@ Property / cites work: Random sampling with a reservoir / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501255
@@ Property / cites work: Q5501255 / rank @@
+Normal rank