Sciweavers

872 search results - page 174 / 175
» Extreme lower probabilities
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 23 days ago
On Communication over Unknown Sparse Frequency-Selective Block-Fading Channels
The problem of reliable communication over unknown frequency-selective block-fading channels with sparse impulse responses is considered. In particular, discrete-time impulse respo...
Arun Pachai Kannu, Philip Schniter
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 17 days ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
JSS
2011
150views more  JSS 2011»
13 years 6 days ago
A novel general framework for automatic and cost-effective handling of recoverable temporal violations in scientific workflow sy
Due to the complex nature of scientific workflow environments, temporal violations often take place and may severely reduce the timeliness of the execution’s results. To handle ...
Xiao Liu, Zhiwei Ni, Zhangjun Wu, Dong Yuan, Jinju...
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 9 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 8 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky