Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Shinichi Nakajima"'
Publikováno v:
Mathematics, Vol 11, Iss 12, p 2628 (2023)
Considering the worst-case scenario, the junction-tree algorithm remains the most general solution for exact MAP inference with polynomial run-time guarantees. Unfortunately, its main tractability assumption requires the treewidth of a corresponding
Externí odkaz:
https://doaj.org/article/4a63eb90028d40f09d12d1c7d0c4f2ad