Sciweavers

555 search results - page 89 / 111
» Bayesian Compressive Sensing
Sort
View
3DOR
2008
13 years 10 months ago
Markov Random Fields for Improving 3D Mesh Analysis and Segmentation
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
Guillaume Lavoué, Christian Wolf
SRDS
2010
IEEE
13 years 5 months ago
Shedding Light on Enterprise Network Failures Using Spotlight
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
Dipu John, Pawan Prakash, Ramana Rao Kompella, Ran...
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Inference of Graphical Causal Models: Representing the Meaningful Information of Probability Distributions
This paper studies the feasibility and interpretation of learning the causal structure from observational data with the principles behind the Kolmogorov Minimal Sufficient Statist...
Jan Lemeire, Kris Steenhaut
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 7 months ago
Sparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of p, a class of compressed sensing decoders that rely on p minimization with p (0, 1) to recover estimates of sparse and compr...
Rayan Saab, Özgür Yilmaz
SIAMSC
2010
215views more  SIAMSC 2010»
13 years 6 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang