Back to Results
First PageMeta Content
Constraint graph / Tree decomposition / Bayesian network / Graphical model / Constraint satisfaction / Directed acyclic graph / Graph / Local consistency / Complexity of constraint satisfaction / Graph theory / Constraint programming / Decomposition method


Unifying Cluster-Tree Decompositions for Reasoning in Graphical models∗ Kalev Kask∗ , Rina Dechter∗ , Javier Larrosa∗∗ and Avi Dechter∗∗∗ ∗ Bren School of Information and Computer Science,
Add to Reading List

Document Date: 2005-04-17 02:08:23


Open Document

File Size: 834,92 KB

Share Result on Facebook

City

Barcelona / /

Company

Belief Networks Belief Networks / ABC / BT / Constraint Networks / /

Country

United States / Spain / /

Facility

California State University / University of California / /

IndustryTerm

tree-processing algorithm / clique-tree algorithm / bucket-tree elimination algorithm / query processing / belief network / tree-decomposition algorithms / tree-decomposition processing / combination operator / variable elimination algorithms / tree-processing algorithms / marginalization operator / /

Organization

National Science Foundation / Bren School of Information and Computer Science / California State University / Northridge / Universitat Politcnica de Catalunya / University of California / Irvine / /

Person

Javier Larrosa / Rina Dechter / Avi Dechter / /

ProvinceOrState

California / /

Technology

tree-processing algorithms / relational database / tree-decomposition algorithms / variable elimination algorithms / tree-processing algorithm / bucket-tree elimination algorithm / machine learning / present two algorithms / clique-tree algorithm / /

SocialTag