377 search results - page 54 / 76 » Convergence of Stochastic Iterative Dynamic Programming Algo... |
154
click to vote
CORR
2011
Springer
14 years 11 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...
186
click to vote
JMLR
2012
13 years 6 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...
128
click to vote
ALMOB
2006
15 years 4 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...
134
click to vote
SAC
2002
ACM
15 years 4 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]...
130
click to vote
ICML
2008
IEEE
16 years 5 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 ...