Sciweavers

377 search results - page 32 / 76
» Distributionally Robust Optimization and Its Tractable Appro...
Sort
View
JACM
2006
99views more  JACM 2006»
14 years 11 months ago
Finding a maximum likelihood tree is hard
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...
Benny Chor, Tamir Tuller
ICCV
2003
IEEE
16 years 1 months ago
Ranking Prior Likelihood Distributions for Bayesian Shape Localization Framework
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 ...
Shuicheng Yan, Mingjing Li, HongJiang Zhang, QianS...
PODS
2008
ACM
159views Database» more  PODS 2008»
15 years 12 months ago
Approximation algorithms for clustering uncertain data
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...
Graham Cormode, Andrew McGregor
ESCIENCE
2006
IEEE
15 years 5 months ago
Niching for Population-Based Ant Colony Optimization
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...
Daniel Angus
ICA
2004
Springer
15 years 5 months ago
Blind Deconvolution Using the Relative Newton Method
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...