Search

Cassio Polpo de Campos

Robustifying sum-product networks
Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks
Credal Sum-Product Networks
Hidden Markov models with set-valued parameters
The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages
Advances in Learning Bayesian Networks of Bounded Treewidth
Advances in Learning Bayesian Networks of Bounded Treewidth
Algorithms for Hidden Markov Models With Imprecisely Specified Parameters
Probabilistic Inference in Credal Networks: New Complexity Results
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
On the Complexity of Strong and Epistemic Credal Networks
Anytime Marginal MAP Inference
Solving Limited Memory Influence Diagrams
The Complexity of Approximately Solving Influence Diagrams
Updating Credal Networks is Approximable in Polynomial Time
Solving Limited Memory Influence Diagrams
A Fully Polynomial Time Approximation Scheme for Updating Credal Networks of Bounded Treewidth and Number of Variable States
Solving Decision Problems with Limited Information

I thank the generous support of Alpha Vantage API in providing scholarly financial & statistical datasets used in our research

Published with Wowchemy — the free, open source website builder that empowers creators.