Sciweavers

3221 search results - page 418 / 645
» Termination of Linear Programs
Sort
View
CIMAGING
2009
120views Hardware» more  CIMAGING 2009»
15 years 7 months ago
Dantzig selector homotopy with dynamic measurements
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
Muhammad Salman Asif, Justin K. Romberg
ECAI
2010
Springer
15 years 7 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
CORR
2008
Springer
234views Education» more  CORR 2008»
15 years 6 months ago
Bayesian Compressive Sensing via Belief Propagation
Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-N...
Dror Baron, Shriram Sarvotham, Richard G. Baraniuk
CORR
2007
Springer
124views Education» more  CORR 2007»
15 years 6 months ago
Graph-Based Decoding in the Presence of ISI
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
Mohammad H. Taghavi, Paul H. Siegel
DM
2007
125views more  DM 2007»
15 years 6 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze