Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
In this paper, we formulate the shape localization problem in the Bayesian framework. In the learning stage, we propose the Constrained RankBoost approach to model the likelihood ...
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...
We propose a relative optimization framework for quasi maximum likelihood blind deconvolution and the relative Newton method as its particular instance. Special Hessian structure a...
Alexander M. Bronstein, Michael M. Bronstein, Mich...