Sciweavers

266 search results - page 46 / 54
» Sparse Numerical Semigroups
Sort
View
CVPR
2011
IEEE
13 years 7 months ago
Online Group-Structured Dictionary Learning
We develop a dictionary learning method which is (i) online, (ii) enables overlapping group structures with (iii) non-convex sparsity-inducing regularization and (iv) handles the ...
Zoltan Szabo, Barnabas Poczos, Andras Lorincz
SIAMIS
2010
190views more  SIAMIS 2010»
13 years 5 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
TSP
2010
13 years 5 months ago
LS-CS-residual (LS-CS): compressive sensing on least squares residual
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
Namrata Vaswani
CORR
2011
Springer
204views Education» more  CORR 2011»
13 years 5 months ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...
SIAMMAX
2011
157views more  SIAMMAX 2011»
13 years 1 months ago
Deflated Restarting for Matrix Functions
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...