2040 search results - page 112 / 408 » Approximate Expectation Maximization |
130
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Iterative decoding is considered in this paper from an optimization point of view. Starting from the optimal maximum likelihood decoding, a (tractable) approximate criterion is de...
117
click to vote
QEST
2006
IEEE
15 years 9 months ago
2006
IEEE
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
119
click to vote
CCCG
2010
15 years 4 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
130
click to vote
MOC
1998
15 years 2 months ago
1998
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
130
click to vote
ICANN
2009
Springer
15 years 7 months ago
2009
Springer
In a typical reinforcement learning (RL) setting details of the environment are not given explicitly but have to be estimated from observations. Most RL approaches only optimize th...