51 search results - page 5 / 11 » Trichotomy in the Complexity of Minimal Inference |
RECOMB
1997
Springer
13 years 11 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
FLAIRS
2006
13 years 8 months ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
UAI
2000
13 years 8 months ago
2000
Sampling is an important tool for estimating large, complex sums and integrals over highdimensional spaces. For instance, importance sampling has been used as an alternative to ex...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...