377 search results - page 54 / 76 » Convergence of Stochastic Iterative Dynamic Programming Algo... |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
JMLR
2012
11 years 10 months ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
ALMOB
2006
13 years 8 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2]...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...