Approximation complexity of maximum a posteriori inference in sum-product networks (2017)
Conaty, Diarmaid; Mauá, Denis Deratani 
; Campos, Cassio P. de
Fonte: Proceedings. Nome do evento: Conference on Uncertainty in Artificial Intelligence. Unidade: IME
Assuntos: INTELIGÊNCIA ARTIFICIAL, MODELOS PARA PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CONATY, Diarmaid e MAUÁ, Denis Deratani e CAMPOS, Cassio P. de. Approximation complexity of maximum a posteriori inference in sum-product networks. 2017, Anais.. Corvallis: AUAI Press, 2017. Disponível em: http://auai.org/uai2017/proceedings/papers/109.pdf. Acesso em: 14 nov. 2025.APA
Conaty, D., Mauá, D. D., & Campos, C. P. de. (2017). Approximation complexity of maximum a posteriori inference in sum-product networks. In Proceedings. Corvallis: AUAI Press. Recuperado de http://auai.org/uai2017/proceedings/papers/109.pdfNLM
Conaty D, Mauá DD, Campos CP de. Approximation complexity of maximum a posteriori inference in sum-product networks [Internet]. Proceedings. 2017 ;[citado 2025 nov. 14 ] Available from: http://auai.org/uai2017/proceedings/papers/109.pdfVancouver
Conaty D, Mauá DD, Campos CP de. Approximation complexity of maximum a posteriori inference in sum-product networks [Internet]. Proceedings. 2017 ;[citado 2025 nov. 14 ] Available from: http://auai.org/uai2017/proceedings/papers/109.pdf
