Sciweavers

358 search results - page 5 / 72
» Sparse squares of polynomials
Sort
View
ICASSP
2011
IEEE
12 years 11 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
ICCV
2009
IEEE
15 years 19 days ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
ICASSP
2011
IEEE
12 years 11 months ago
Sparse channel estimation with lp-norm and reweighted l1-norm penalized least mean squares
The least mean squares (LMS) algorithm is one of the most popular recursive parameter estimation methods. In its standard form it does not take into account any special characteri...
Omid Taheri, Sergiy A. Vorobyov
ICANN
2007
Springer
14 years 1 months ago
Sparse Least Squares Support Vector Regressors Trained in the Reduced Empirical Feature Space
Abstract. In this paper we discuss sparse least squares support vector regressors (sparse LS SVRs) defined in the reduced empirical feature space, which is a subspace of mapped tr...
Shigeo Abe, Kenta Onishi
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 7 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof