13 search results - page 1 / 3 » Strong Lower Bounds for Approximating Distribution Support S... |
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
ICDT
2009
ACM
14 years 5 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
ECCC
2010
13 years 5 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
PODS
2009
ACM
14 years 5 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...