1855 search results - page 147 / 371 » A coding theorem for distributed computation |
129
Voted
STOC
2004
ACM
16 years 3 months 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...
131
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
The JavaPorts system is an environment that facilitates the rapid development of modular, reusable, Java-based parallel and distributed applications for networked machines with het...
141
click to vote
CCS
2008
ACM
15 years 5 months ago
2008
ACM
Harvard architecture CPU design is common in the embedded world. Examples of Harvard-based architecture devices are the Mica family of wireless sensors. Mica motes have limited me...
125
Voted
CIC
2006
15 years 4 months ago
2006
- We investigate the simplest Slepian-Wolf source network, consisting of an information source correlated with a second source used as a side-information for the decoder but not th...
168
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...