Sciweavers

92 search results - page 13 / 19
» Enumeration, Construction and Random Generation of Block Cod...
Sort
View
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
15 years 2 months ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola
MCAM
2007
Springer
125views Multimedia» more  MCAM 2007»
15 years 3 months ago
Fingerprinting Codes for Live Pay-Television Broadcast Via Internet
In recent years, with the rapid growth of the Internet as well as the increasing demand for broadband services, live pay-television broadcasting via internet has become a promising...
Shuhui Hou, Tetsutaro Uehara, Yoshitaka Morimura, ...
INFOCOM
2007
IEEE
15 years 3 months ago
Network Coding for Distributed Storage Systems
—Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-pee...
Alexandros G. Dimakis, Brighten Godfrey, Martin J....
149
Voted
PEPM
2009
ACM
16 years 9 months ago
Static Consistency Checking for Verilog Wire Interconnects
The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many ...
Cherif Salama, Gregory Malecha, Walid Taha, Jim Gr...
87
Voted
PLDI
2006
ACM
15 years 3 months ago
Optimizing memory transactions
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
Timothy L. Harris, Mark Plesko, Avraham Shinnar, D...