dc.contributor.advisor | http://orcid.org/0000-0002-8425-896X | |
dc.contributor.author | Shenoy, Prakash P. | |
dc.date.accessioned | 2004-12-20T15:10:14Z | |
dc.date.available | 2004-12-20T15:10:14Z | |
dc.date.issued | 1996 | |
dc.identifier.citation | Shenoy, P. P., "Binary Join Trees," in E. Horvitz and F. V. Jensen (eds.), Uncertainty in Artificial Intelligence, Vol. 12, 1996, pp. 492--499, Morgan Kaufmann, San Francisco, CA. | |
dc.identifier.isbn | 1-55860-412-X | |
dc.identifier.uri | http://hdl.handle.net/1808/178 | |
dc.description | A longer and updated version of this paper appears in: Shenoy, P. P., "Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture," International Journal of Approximate Reasoning, 17(2--3), 1997, 239--263 (available from <http://hdl.handle.net/1808/172>. | |
dc.description.abstract | The main goal of this paper is to describe a datastructure called binary join trees that are useful incomputing multiple marginals efficiently usingthe Shenoy-Shafer architecture. We define binaryjoin trees, describe their utility, and sketch a procedure for constructing them. | |
dc.format.extent | 173941 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | |
dc.publisher | Morgan Kaufmann Publishers | |
dc.subject | Computing marginals | |
dc.subject | Shenoy-Shafer architecture | |
dc.subject | Join trees | |
dc.title | Binary Join Trees | |
dc.type | Book chapter | |
kusw.oastatus | na | |
dc.identifier.orcid | https://orcid.org/0000-0002-8425-896X | |
kusw.oapolicy | This item does not meet KU Open Access policy criteria. | |
dc.rights.accessrights | openAccess | |