388 search results - page 49 / 78 » Robust Lower Bounds for Communication and Stream Computation |
170
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
155
click to vote
SOFSEM
1997
Springer
15 years 10 months ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
175
Voted
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—A fundamental challenge of managing mutable data replication in a Peer-to-Peer (P2P) system is how to efficiently maintain consistency under various sharing patterns with heter...
133
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
153
click to vote
ICC
2007
IEEE
16 years 13 days ago
2007
IEEE
Abstract— The performance of a noncoherent digital delaylock loop (DDLL) with a RAKE scheme for direct-sequence spread-spectrum code division multiple access (DS/SS-CDMA) signals...