528 search results - page 36 / 106 » Causal inference using the algorithmic Markov condition |
158
click to vote
JAIR
1998
15 years 4 months ago
1998
This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of fini...
155
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Protein fold recognition is a key step towards inferring the tertiary structures from amino-acid sequences. Complex folds such as those consisting of interacting structural repeat...
150
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
166
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
166
click to vote
IBERAMIA
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we tackle the problem of providing a mobile robot with the ability to build a map of its environment using data gathered during navigation. The data correspond to the...