Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks Jan 1, 2017· Diarmaid Conaty , Denis Deratani Mauá , Cassio Polpo De Campos · 0 min read PDF Cite Type 1 Publication Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence Last updated on Jan 1, 2017 ← Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks Mar 1, 2017 Closed-Form Solutions in Learning Probabilistic Logic Programs by Exact Score Maximization Jan 1, 2017 →