388 search results - page 27 / 78 » Robust Lower Bounds for Communication and Stream Computation |
171
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
181
Voted
TCS
2012
14 years 1 months ago
2012
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
148
click to vote
DCC
2009
IEEE
16 years 6 months ago
2009
IEEE
This paper considers the problem of transmitting the difference of two positively correlated Gaussian sources over a two-user additive Gaussian noise multiple access channel (MAC)...
173
click to vote
SIAMCOMP
2002
15 years 5 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
178
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...