914 search results - page 94 / 183 » The Computational Complexity of Probabilistic Planning |
129
click to vote
JMLR
2010
14 years 11 months ago
2010
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...
130
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
We present a novel technique for the recognition of complex human gestures for video annotation using accelerometers and the hidden Markov model. Our extension to the standard hid...
154
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
139
click to vote
NC
2008
15 years 4 months ago
2008
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
128
click to vote
ICCD
2006
IEEE
16 years 1 months ago
2006
IEEE
— As silicon CMOS devices are scaled down into the nanoscale regime, new challenges at both the device and system level are arising. While some of these challenges will be overco...