2040 search results - page 232 / 408 » Approximate Expectation Maximization |
174
click to vote
JMLR
2010
15 years 1 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
187
click to vote
PE
2010
Springer
15 years 1 months ago
2010
Springer
Fluid modelling is a next-generation technique for analysing massive performance models. Passive cooperation is a popular cooperation mechanism frequently used by performance engi...
197
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
173
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We propose a new algorithm for two-phase, piecewise-smooth segmentation with shape prior. The image is segmented by a binary template that is deformed by a regular geometric transf...
300
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...