The Space Complexity of Approximating the Frequency Moments
Reads0
Chats0
TLDR
In this paper, the authors considered the space complexity of randomized algorithms that approximate the frequency moments of a sequence, where the elements of the sequence are given one by one and cannot be stored.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1999-02-01 and is currently open access. It has received 1456 citations till now. The article focuses on the topics: Sequence space & Sequence.read more
Citations
More filters
Journal ArticleDOI
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Emmanuel J. Candès,Terence Tao +1 more
TL;DR: If the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program.
Proceedings ArticleDOI
Similarity estimation techniques from rounding algorithms
TL;DR: It is shown that rounding algorithms for LPs and SDPs used in the context of approximation algorithms can be viewed as locality sensitive hashing schemes for several interesting collections of objects.
Journal ArticleDOI
An improved data stream summary: the count-min sketch and its applications
Graham Cormode,S. Muthukrishnan +1 more
TL;DR: In this paper, the authors introduce a sublinear space data structure called the countmin sketch for summarizing data streams, which allows fundamental queries in data stream summarization such as point, range, and inner product queries to be approximately answered very quickly; in addition it can be applied to solve several important problems in data streams such as finding quantiles, frequent items, etc.
Proceedings ArticleDOI
Gossip-based computation of aggregate information
TL;DR: This paper analyzes the diffusion speed of uniform gossip in the presence of node and link failures, as well as for flooding-based mechanisms, and shows that this diffusion speed is at the heart of the approximation guarantees for all of the above problems.
Journal ArticleDOI
Privacy-preserving data publishing: A survey of recent developments
TL;DR: This survey will systematically summarize and evaluate different approaches to PPDP, study the challenges in practical data publishing, clarify the differences and requirements that distinguish P PDP from other related problems, and propose future research directions.
References
More filters
Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Book
The Probabilistic Method
TL;DR: A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
Proceedings ArticleDOI
Some complexity questions related to distributive computing(Preliminary Report)
TL;DR: The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm.
Journal ArticleDOI
A fast and simple randomized parallel algorithm for the maximal independent set problem
TL;DR: A technique due to A. Joffe (1974) is applied and deterministic construction in fast parallel time of various combinatorial objects whose existence follows from probabilistic arguments is obtained.
Book
Maintenance of materialized views: problems, techniques, and applications
TL;DR: This chapter contains sections titled: Introduction, The Idea Behind View Maintenance, Using Full Information, Using Partial Information, Open Problems, Acknowledgments.