Denis Deratani Mauá
Open Menu
Close Menu
Bio
Publications
Talks
CV
Projects
Publications
Denis Deratani Mauá
,
Cassio Polpo De Campos
,
Alessio Benavoli
,
Alessandro Antonucci
(2014).
Probabilistic Inference in Credal Networks: New Complexity Results
.
Journal of Artificial Intelligence Research
.
Cite
DOI
Denis Deratani Mauá
(2014).
Equivalences between Maximum a Posteriori Inference in Bayesian Networks and Maximum Expected Utility Computation in Influence Diagrams
.
Proceedings of the 7th European Workshop on Probabilistic Graphical Models
.
Cite
DOI
Denis Deratani Mauá
,
Cassio Polpo De Campos
,
Alessandro Antonucci
(2014).
Algorithms for Hidden Markov Models With Imprecisely Specified Parameters
.
Proccedings of the 2014 Brazilian Conference on Intelligent Systems
.
URL
Cite
DOI
Siqi Nie
,
Denis D. Mauá
,
Cassio Polpo De Campos
,
Qiang Ji
(2014).
Advances in Learning Bayesian Networks of Bounded Treewidth
.
Advances in Neural Information Processing Systems 27
.
URL
Cite
Siqi Nie
,
Denis Deratani Mauá
,
Cassio Polpo De Campos
,
Qiang Ji
(2014).
Advances in Learning Bayesian Networks of Bounded Treewidth
.
URL
Cite
Denis D. Mauá
,
Cassio Polpo De Campos
,
Alessio Benavoli
,
Alessandro Antonucci
(2013).
On the Complexity of Strong and Epistemic Credal Networks
.
Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence (UAI)
.
URL
Cite
Denis D. Mauá
,
Cassio Polpo De Campos
,
Marco Zaffalon
(2013).
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
.
Artificial Intelligence
.
URL
Cite
DOI
Alessandro Antonucci
,
Giorgio Corani
,
Denis Deratani Mauá
,
Sandra Gabaglio
(2013).
An Ensemble of Bayesian Networks for Multilabel Classification
.
Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI)
.
Cite
PDF
Denis Deratani Mauá
(2013).
Algorithms and Complexity Results for Discrete Probabilistic Reasoning Tasks
.
URL
Cite
Denis D. Mauá
,
Cassio Polpo De Campos
,
Marco Zaffalon
(2012).
Updating Credal Networks is Approximable in Polynomial Time
.
International Journal of Approximate Reasoning
.
URL
Cite
DOI
« Previous
Next »