1362 search results - page 100 / 273 » Means, Correlations and Bounds |
TIT
2002
15 years 1 months ago
2002
The problem of placing training symbols optimally for orthogonal frequency-division multiplexing (OFDM) and single-carrier systems is considered. The channel is assumed to be quasi...
119
click to vote
RTAS
2010
IEEE
15 years 2 days ago
2010
IEEE
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
153
click to vote
NFM
2011
14 years 8 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
105
click to vote
TSP
2010
14 years 8 months ago
2010
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
172
click to vote
PODC
2011
ACM
14 years 4 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...