188 search results - page 27 / 38 » Estimation error bounds for denoising by sparse approximatio... |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
CSDA
2008
14 years 9 months ago
2008
A Bayesian approach to analyze the modes of variation in a set of curves is suggested. It is based on a generative model thus allowing for noisy and sparse observations of curves....
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we re-examine the recently proposed distributed state estimators based on quantized innovations. It is widely believed that the error covariance of the Quantized In...
MP
2002
14 years 9 months ago
2002
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
78
Voted
NIPS
2001
14 years 11 months ago
2001
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...