Sciweavers

1273 search results - page 164 / 255
» Recovery from
Sort
View
ICASSP
2011
IEEE
12 years 12 months ago
Estimating Sparse MIMO channels having Common Support
We propose an algorithm (SCS-FRI) to estimate multipath channels with Sparse Common Support (SCS) based on Finite Rate of Innovation (FRI) sampling. In this setup, theoretical low...
Yann Barbotin, Ali Hormati, Sundeep Rangan, Martin...
ICASSP
2011
IEEE
12 years 12 months ago
Improved thresholds for rank minimization
—Nuclear norm minimization (NNM) has recently gained attention for its use in rank minimization problems. In this paper, we define weak, sectional and strong recovery for NNM to...
Samet Oymak, M. Amin Khajehnejad, Babak Hassibi
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 4 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
SOSP
2003
ACM
14 years 5 months ago
Improving the reliability of commodity operating systems
Despite decades of research in extensible operating system technology, extensions such as device drivers remain a significant cause of system failures. In Windows XP, for example,...
Michael M. Swift, Brian N. Bershad, Henry M. Levy
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 3 months 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