73 search results - page 4 / 15 » Thin Junction Trees |
118
click to vote
MICCAI
2005
Springer
16 years 2 months ago
2005
Springer
We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimizat...
109
Voted
IPSN
2005
Springer
15 years 7 months ago
2005
Springer
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
118
Voted
PACT
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
124
Voted
UAI
1992
15 years 3 months ago
1992
Current Bayesian net representations do not consider structure in the domain and include all variables in a homogeneous network. At any time, a human reasoner in a large domain ma...
89
Voted
FLAIRS
2001
15 years 3 months ago
2001
A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagation in Bayesian networks (BNs). A graphical method ...