Sciweavers

ICASSP
2011
IEEE
12 years 8 months ago
Recovery of sparse perturbations in Least Squares problems
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
Mert Pilanci, Orhan Arikan
AUTOMATICA
2007
75views more  AUTOMATICA 2007»
13 years 4 months ago
Systematic ultimate bound computation for sampled-data systems with quantization
We present a novel systematic method to obtain componentwise ultimate bounds in perturbed sampled-data systems, especially when the perturbations arise due to quantization. The pr...
Hernan Haimovich, Ernesto Kofman, María M. ...