Sciweavers

388 search results - page 67 / 78
» Robust Lower Bounds for Communication and Stream Computation
Sort
View
SPAA
2003
ACM
15 years 4 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 3 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
PC
2008
123views Management» more  PC 2008»
14 years 11 months ago
The impact of heterogeneity on master-slave scheduling
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...
Jean-Francois Pineau, Yves Robert, Fréd&eac...
MOBICOM
2005
ACM
15 years 4 months ago
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are chara...
Murali S. Kodialam, Thyaga Nandagopal
97
Voted
VTC
2006
IEEE
114views Communications» more  VTC 2006»
15 years 5 months ago
Channel Capacity of BLAST based on the Zero-Forcing criterion
In this paper, we present an asymptotical analysis of channel capacity of Bell labs layered space-time (BLAST) architectures based on a zero-forcing (ZF) criterion in the sense of...
Heunchul Lee, Inkyu Lee