Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

72

UAI
1996

favoriteEmaildiscussreport

139views Artificial Intelligence» more UAI 1996»

Binary Join Trees

15 years 1 days ago

Binary Join Trees

Download web.ku.edu

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.

Prakash P. Shenoy

Real-time Traffic

Binary Join Trees | Main Goal | Multiple Marginals | UAI 1996 | UAI 2008 |

claim paper

Related Content

» ComputationalWorkload Based Binarization and Partition of Qualitative Markov Trees for Bel...

» Optimizing recursive queries in SQL

» Inorder traversal of splay trees

» Efficient Certification Path Discovery for MANET

» BSPAssisted Constrained Tetrahedralization

» 2Binary trees Bijections and related issues

» A Balanced TreeBased Strategy for Unstructured Media Distribution in P2P Networks

» Join Tree Propagation Utilizing Both Arc Reversal and Variable Elimination

» Approximate Joins for DataCentric XML

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1996
Where	UAI
Authors	Prakash P. Shenoy

Comments (0)