Sciweavers

2237 search results - page 379 / 448
» On the Security of Random Sources
Sort
View
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
14 years 9 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
TJS
2002
160views more  TJS 2002»
14 years 9 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
CORR
2008
Springer
99views Education» more  CORR 2008»
14 years 9 months ago
An Energy-Based Comparison of Long-Hop and Short-Hop Routing in MIMO Networks
This paper considers the problem of selecting either routes that consist of long hops or routes that consist of short hops in a network of multiple-antenna nodes, where each trans...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
INFOCOM
2010
IEEE
14 years 8 months ago
The Capacity of Heterogeneous Wireless Networks
—Although capacity has been extensively studied in wireless networks, most of the results are for homogeneous wireless networks where all nodes are assumed identical. In this pap...
Pan Li, Yuguang Fang
GLOBECOM
2010
IEEE
14 years 7 months ago
Online Network Coding for Time-Division Duplexing
We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals. We model the system as a bulk-service queue with variabl...
Daniel Enrique Lucani, Muriel Médard, Milic...