All Title Author
Keywords Abstract

Binary Join Trees

Full-Text   Cite this paper   Add to My Lib


The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architecture. We define binary join trees, describe their utility, and sketch a procedure for constructing them.


comments powered by Disqus

Contact Us


微信:OALib Journal