388 search results - page 20 / 78 » Robust Lower Bounds for Communication and Stream Computation |
143
click to vote
TCS
1998
15 years 5 months ago
1998
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
166
click to vote
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
The throughput of delay sensitive traffic in a Rayleigh fading network is studied by adopting a scaling limit approach. The case of study is that of a pair of nodes establishing a ...
214
click to vote
DASC
2006
IEEE
16 years 1 days ago
2006
IEEE
Abstract— This paper describes Service Clouds, a distributed infrastructure designed to facilitate rapid prototyping and deployment of services that enhance communication perform...
156
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
148
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...