Sciweavers

45 search results - page 8 / 9
» Limits to List Decoding Random Codes
Sort
View
CCS
2004
ACM
13 years 11 months ago
On the effectiveness of address-space randomization
Address-space randomization is a technique used to fortify systems against bu er over ow attacks. The idea is to introduce arti cial diversity by randomizing the memory location o...
Hovav Shacham, Matthew Page, Ben Pfaff, Eu-Jin Goh...
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
CORR
2007
Springer
94views Education» more  CORR 2007»
13 years 5 months ago
Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels
— This paper studies a variant of the classical problem of “writing on dirty paper” in which the sum of the input and the interference, or dirt, is multiplied by a random var...
Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Lan...
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
13 years 4 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
CORR
2011
Springer
200views Education» more  CORR 2011»
13 years 25 days ago
Beating the Gilbert-Varshamov Bound for Online Channels
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
Ishay Haviv, Michael Langberg