Sciweavers

3044 search results - page 542 / 609
» Linear logical approximations
Sort
View
TIP
2011
170views more  TIP 2011»
13 years 2 months ago
Image Denoising in Mixed Poisson-Gaussian Noise
—We propose a general methodology (PURE-LET) to design and optimize a wide class of transform-domain thresholding algorithms for denoising images corrupted by mixed Poisson–Gau...
Florian Luisier, Thierry Blu, Michael Unser
TOMS
2011
101views more  TOMS 2011»
13 years 2 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
JGO
2010
100views more  JGO 2010»
13 years 2 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
JMLR
2010
119views more  JMLR 2010»
13 years 2 months ago
A Convergent Online Single Time Scale Actor Critic Algorithm
Actor-Critic based approaches were among the first to address reinforcement learning in a general setting. Recently, these algorithms have gained renewed interest due to their gen...
Dotan Di Castro, Ron Meir
JMLR
2010
147views more  JMLR 2010»
13 years 2 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani