193 search results - page 3 / 39 » Approximate Maximum Parsimony and Ancestral Maximum Likeliho... |
RECOMB
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
ICIP
1995
IEEE
14 years 6 months ago
1995
IEEE
JMLR
2010
2010
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
13 years 1 days ago
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...
PAMI
2006
13 years 5 months ago
2006
This study investigates a level set method for complex polarimetric image segmentation. It consists of minimizing a functional containing an original observation term derived from ...
ISMB
2004
13 years 6 months ago
2004
