151 search results - page 25 / 31 » A Lower Bound on List Size for List Decoding |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
CONEXT
2005
ACM
13 years 9 months ago
2005
ACM
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
PERVASIVE
2008
Springer
13 years 7 months ago
2008
Springer
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...