Sciweavers

140 search results - page 1 / 28
» Highly robust error correction by convex programming
Sort
View
CORR
2006
Springer
92views Education» more  CORR 2006»
13 years 4 months ago
Highly robust error correction by convex programming
This paper discusses a stylized communications problem where one wishes to transmit a real-valued signal x Rn (a block of n pieces of information) to a remote receiver. We ask wh...
Emmanuel J. Candès, Paige A. Randall
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 5 months ago
Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit
Abstract--We consider the problem of recovering a lowrank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magn...
Arvind Ganesh, John Wright, Xiaodong Li, Emmanuel ...
CACM
2008
131views more  CACM 2008»
13 years 5 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
CORR
2011
Springer
202views Education» more  CORR 2011»
12 years 11 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
ICASSP
2009
IEEE
13 years 8 months ago
Design of robust superdirective beamformers as a convex optimization problem
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
Edwin Mabande, Adrian Schad, Walter Kellermann