Sciweavers

188 search results - page 22 / 38
» Estimation error bounds for denoising by sparse approximatio...
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 9 months ago
Sequential Compressed Sensing
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
JSCIC
2010
101views more  JSCIC 2010»
14 years 4 months ago
Boundary-Conforming Discontinuous Galerkin Methods via Extensions from Subdomains
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
Bernardo Cockburn, Deepa Gupta, Fernando Reitich
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Distance Labeling in Hyperbolic Graphs
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
Cyril Gavoille, Olivier Ly
SIAMNUM
2010
87views more  SIAMNUM 2010»
14 years 4 months ago
A Finite Element Method for Density Estimation with Gaussian Process Priors
Abstract. A variational problem characterizing the density estimator defined by the maximum a posteriori method with Gaussian process priors is derived. It is shown that this probl...
Michael Griebel, Markus Hegland