Exploiting Within-Clique Factorizations in Junction-Tree Algorithms

Julian J. McAuley, Tibério S. Caetano

Abstract: We show that the expected computational complexity of the Junction-Tree Algorithm for maximum a posteriori inference in graphical models can be improved. Our results apply whenever the potentials o...