220 search results - page 14 / 44 » SMOS L1 algorithms |
138
Voted
TIP
2010
14 years 10 months ago
2010
We introduce a class of inverse problem estimators computed by mixing adaptively a family of linear estimators corresponding to different priors. Sparse mixing weights are calcula...
215
Voted
ORL
2011
14 years 10 months ago
2011
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
138
Voted
PPAM
2005
Springer
15 years 9 months ago
2005
Springer
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
122
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
122
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...