Conference on Uncertainty in Artificial Intelligence, UAI 2017


Article Details
Title: Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks
Article URLs:
Alternative Article URLs:
Authors: Diarmaid Conaty
  • Queen’s University Belfast
Cassio Polpo de Campos
  • Queen’s University Belfast
Denis Deratani Mauá
  • Universidade de Sao Paulo
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/uai/ConatyCM17
Author Comments:

Discuss this paper and its artifacts below