ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1703.06045
  4. Cited By
Approximation Complexity of Maximum A Posteriori Inference in
  Sum-Product Networks

Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks

17 March 2017
Diarmaid Conaty
Denis Deratani Mauá
Cassio P. de Campos
    TPM
ArXivPDFHTML

Papers citing "Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks"

6 / 6 papers shown
Title
On Relaxing Determinism in Arithmetic Circuits
On Relaxing Determinism in Arithmetic Circuits
Arthur Choi
Adnan Darwiche
34
57
0
22 Aug 2017
On the Latent Variable Interpretation in Sum-Product Networks
On the Latent Variable Interpretation in Sum-Product Networks
Robert Peharz
Robert Gens
Franz Pernkopf
Pedro M. Domingos
TPM
25
132
0
22 Jan 2016
Learning Tractable Probabilistic Models for Fault Localization
Learning Tractable Probabilistic Models for Fault Localization
Aniruddh Nath
Pedro M. Domingos
TPM
41
27
0
07 Jul 2015
On the Relationship between Sum-Product Networks and Bayesian Networks
On the Relationship between Sum-Product Networks and Bayesian Networks
Haiying Zhao
Mazen Melibari
Pascal Poupart
TPM
72
91
0
06 Jan 2015
A Differential Approach to Inference in Bayesian Networks
A Differential Approach to Inference in Bayesian Networks
Adnan Darwiche
TPM
67
619
0
16 Jan 2013
Sum-Product Networks: A New Deep Architecture
Sum-Product Networks: A New Deep Architecture
Hoifung Poon
Pedro M. Domingos
TPM
69
757
0
14 Feb 2012
1