2655 search results - page 16 / 531 » LT Network Codes |
DCOSS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
CRYPTO
2006
Springer
14 years 23 days ago
2006
Springer
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
GLOBECOM
2008
IEEE
13 years 10 months ago
2008
IEEE
TIT
2010
13 years 3 months ago
2010
TIT
2008
13 years 9 months ago
2008
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...