388 search results - page 18 / 78 » Robust Lower Bounds for Communication and Stream Computation |
172
click to vote
AI50
2006
15 years 9 months ago
2006
Computers have become an essential part of modern life, providing services in a multiplicity of ways. Access to these services, however, comes at a price: human attention is bound...
145
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
139
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
184
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— This paper presents DONet, a Data-driven Overlay Network for live media streaming. The core operations in DONet are very simple: every node periodically exchanges data availabi...
150
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...