Sciweavers

220 search results - page 8 / 44
» SMOS L1 algorithms
Sort
View
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 8 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
TMI
2010
298views more  TMI 2010»
13 years 2 months ago
An Efficient Numerical Method for General Lp Regularization in Fluorescence Molecular Tomography
Abstract--Reconstruction algorithms for fluorescence tomography have to address two crucial issues : (i) the ill-posedness of the reconstruction problem, (ii) the large scale of nu...
Jean-Charles Baritaux, Kai Hassler, Michael Unser
MICCAI
2010
Springer
13 years 5 months ago
Efficient MR Image Reconstruction for Compressed MR Imaging
In this paper, we propose an efficient algorithm for MR image reconstruction. The algorithm minimizes a linear combination of three terms corresponding to a least square data fitti...
Junzhou Huang, Shaoting Zhang, Dimitris N. Metaxas
ANTS
1994
Springer
105views Algorithms» more  ANTS 1994»
13 years 11 months ago
A fast variant of the Gaussian reduction algorithm
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...
Michael Kaib
ICASSP
2008
IEEE
14 years 2 months ago
Compressed sensing - a look beyond linear programming
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...
Christian R. Berger, Javier Areta, Krishna R. Patt...