Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CORR
2012
Springer
224views Education» more  CORR 2012»
9 years 2 months ago
On the Lagrangian Biduality of Sparsity Minimization Problems
We present a novel primal-dual analysis on a class of NPhard sparsity minimization problems to provide new interpretations for their well known convex relaxations. We show that th...
Dheeraj Singaraju, Ehsan Elhamifar, Roberto Tron, ...
FOCM
2011
188views more  FOCM 2011»
9 years 10 months ago
Compressive Wave Computation
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
Laurent Demanet, Gabriel Peyré
ICASSP
2011
IEEE
9 years 10 months ago
Bounded gradient projection methods for sparse signal recovery
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
James Hernandez, Zachary T. Harmany, Daniel Thomps...
ICASSP
2011
IEEE
9 years 10 months ago
Sparse video recovery using Linearly Constrained Gradient Projection
This paper concerns the reconstruction of a temporally-varying scene from a video sequence of noisy linear projections. Assuming that each video frame is sparse or compressible in...
Daniel Thompson, Zachary T. Harmany, Roummel F. Ma...
ICASSP
2011
IEEE
9 years 10 months ago
An augmented Lagrangian method for video restoration
This paper presents a fast algorithm for restoring video sequences. The proposed algorithm, as opposed to existing methods, does not consider video restoration as a sequence of im...
Stanley H. Chan, Ramsin Khoshabeh, Kristofor B. Gi...
SIAMREV
2010
174views more  SIAMREV 2010»
10 years 1 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo
ICIP
2010
IEEE
10 years 4 months ago
Gradient projection for linearly constrained convex optimization in sparse signal recovery
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
Zachary T. Harmany, Daniel Thompson, Rebecca Wille...
INFORMATICALT
2006
117views more  INFORMATICALT 2006»
10 years 6 months ago
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
Adam Janiak, Mikhail Y. Kovalyov
WCE
2007
10 years 7 months ago
A Multidimensional Bisection Method for Minimizing Function over Simplex
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
A. N. Baushev, E. Y. Morozova
AAAI
1990
10 years 7 months ago
Probabilistic Semantics for Cost Based Abduction
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...
Eugene Charniak, Solomon Eyal Shimony
books