459 search results - page 58 / 92 » Computational Complexity of Probabilistic Disambiguation |
IWINAC
2007
Springer
15 years 6 months ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
118
click to vote
SSPR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In surveillance systems for monitoring people behaviour, it is imporant to build systems that can adapt to the signatures of the people tasks and movements in the environ...
RECOMB
2010
Springer
15 years 6 months ago
2010
Springer
Background: The empirical frequencies of DNA k-mers in whole genome sequences provide an interesting perspective on genomic complexity, and the availability of large segments of g...
ICML
2009
IEEE
16 years 18 days ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
Identification of regulatory signals in DNA depends on the nature and quality of the patterns of representative sequences. These patterns are constructed from training sets of se...