388 search results - page 22 / 78 » Robust Lower Bounds for Communication and Stream Computation |
159
click to vote
SSDBM
2007
IEEE
16 years 7 days ago
2007
IEEE
Memory management is a critical issue in stream processing involving stateful operators such as join. Traditionally, the memory requirement for a stream join is query-driven: a qu...
150
click to vote
JDA
2008
15 years 6 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
171
click to vote
CONEXT
2010
ACM
15 years 4 months ago
2010
ACM
Peer-to-peer has emerged in recent years as a promising approach to providing Video-on-Demand streaming. The design space, however, is vast and still not well understood--yet choo...
168
click to vote
QCQC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
234
click to vote
CALCO
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We propose a probabilistic interpretation of a class of reversible communicating processes. The rate of forward and backward computing steps, instead of being given expli...