412 search results - page 36 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
143
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper, we concentrate on opportunistic scheduling for multicast information. We pose the problem as a multicast throughput optimization problem. As a solution we presen...
182
Voted
STOC
2000
ACM
15 years 7 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
115
Voted
ASIACRYPT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
144
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes...
124
click to vote
IWDW
2005
Springer
15 years 9 months ago
2005
Springer
In a fingerprinting scheme a distributor places marks in each copy of a digital object. Placing different marks in different copies, uniquely identifies the recipient of each cop...