1972 search results - page 361 / 395 » Evolutionary algorithms and dynamic programming |
131
Voted
BMCBI
2005
15 years 2 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
147
Voted
CANDC
2004
ACM
15 years 2 months ago
2004
ACM
Gene and protein names follow few, if any, true naming conventions and are subject to great variation in different occurrences of the same name. This gives rise to two important p...
127
click to vote
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
198
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
The segmentation of ultrasound images is challenging due to the difficulty of appropriate modeling of their appearance variations including speckle as well as signal dropout. We ...
118
Voted
AAAI
2011
14 years 2 months ago
2011
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...