Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,761 papers from all fields of science
Search
Sign In
Create Free Account
Tree decomposition
Known as:
Clique tree
, Running intersection property
, Junction tree
Expand
In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to define the treewidth of the graph and speed up solving…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Approximation algorithm
Belief propagation
Bramble (graph theory)
Branch-decomposition
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Perceptual color descriptor based on spatial distribution: A top-down approach
S. Kiranyaz
,
M. Birinci
,
M. Gabbouj
Image and Vision Computing
2010
Corpus ID: 13903058
2009
2009
Sensor localization using nonparametric generalized belief propagation in network with loops
V. Savic
,
S. Zazo
Fusion
2009
Corpus ID: 12090306
Belief propagation (BP) is one of the bestknown graphical model for inference in statistical physics, artificial intelligence…
Expand
2008
2008
Local Discriminant Wavelet Packet Basis for Voice Pathology Classification
P. T. Hosseini
,
F. Almasganj
,
Tahereh Emami
,
Roozbeh Behroozmand
,
Shahriar Gharibzade
,
F. Torabinezhad
International Conferences on Biomedical and…
2008
Corpus ID: 34695808
Diagnosis of pathological voice is one of the most important issues in biomedical applications of speech technology. There are…
Expand
2007
2007
Hybrid message passing for mixed bayesian networks
Wei Sun
,
Kuo-Chu Chang
Fusion
2007
Corpus ID: 16347546
The traditional message passing algorithm developed by Pearl in 1980s provides exact inference for discrete poly-tree Bayesian…
Expand
2005
2005
Abductive Inference in Bayesian Networks: Finding a Partition of the Explanation Space
M. Flores
,
José A. Gámez
,
S. Moral
European Conference on Symbolic and Quantitative…
2005
Corpus ID: 206587015
This paper proposes a new approach to the problem of ob- taining the most probable explanations given a set of observations in a…
Expand
2005
2005
Constrained abductive reasoning with fuzzy parameters in Bayesian networks
Han-Lin Li
,
Han-Ying Kao
Computers & Operations Research
2005
Corpus ID: 27895588
2001
2001
Gauss map computation for free-form surfaces
Tait S. Smith
,
R. Farouki
Computer Aided Geometric Design
2001
Corpus ID: 490869
1999
1999
Fully dynamic algorithms for chordal graphs
L. Ibarra
ACM-SIAM Symposium on Discrete Algorithms
1999
Corpus ID: 5270357
We present the fist dynamic algorithm to support the following operations on a chordal graph: (1) test whether deleting or…
Expand
1997
1997
Nested Junction Trees
Uffe Kjærulff
Conference on Uncertainty in Artificial…
1997
Corpus ID: 23754305
The efficiency of inference in both the Hugin and, most notably, the Shafer-Shenoy architectures can be improved by exploiting…
Expand
Highly Cited
1990
Highly Cited
1990
Ideal reformulation of belief networks
J. Breese
,
E. Horvitz
Conference on Uncertainty in Artificial…
1990
Corpus ID: 17354783
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE