518 search results - page 12 / 104 » Beating a Random Assignment |
STOC
2004
ACM
16 years 13 hour ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
102
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— This paper argues for the need to address the issue of multi-channel network performance under constraints on channel switching. We present examples from emergent directions in...
ALGORITHMICA
2010
14 years 12 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
111
click to vote
SECON
2007
IEEE
15 years 6 months ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
TMC
2008
14 years 11 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...