|
KU ScholarWorks >
School of Business >
School of Business Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1808/178
|
|
View usage statistics
|
Full metadata record
| DC Field | Value | Language |
|---|
| 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. | en |
| 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>. | en |
| 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. | en |
| dc.format.extent | 173941 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.publisher | Morgan Kaufmann Publishers | en |
| dc.subject | Computing marginals | en |
| dc.subject | Shenoy-Shafer architecture | en |
| dc.subject | Join trees | en |
| dc.title | Binary Join Trees | en |
| dc.type | Book chapter | en |
| Appears in Collections: | School of Business Articles
|
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
|
top