Binary join trees for computing marginals in the Shenoy-Shafer architecture
We describe a data structure called binary join trees that is useful in computing multiple marginals efficiently in the Shenoy-Shafer architecture. We define binary join trees, describe their utility, and describe a procedure for constructing them. (C) 1997 Elsevier Science Inc.
binary join trees join trees local computation fusion algorithm