Sciweavers

73 search results - page 10 / 15
» Thin Junction Trees
Sort
View
IJUFKS
2000
111views more  IJUFKS 2000»
13 years 9 months ago
A Factorized Representation of Independence of Causal Influence and Lazy Propagation
Theefficiency of algorithmsfor probabilistic inference in Bayesian networks can be improvedby exploiting independenceof causal influence. Thefactorized representation of independe...
Anders L. Madsen, Bruce D'Ambrosio
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 10 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
ICPR
2002
IEEE
14 years 11 months ago
Fast Extraction of Tubular and Tree 3D Surfaces with Front Propagation Methods
We present a new fast approach for surface segmentation of thin structures, like vessels and vascular trees, based on Fast Marching and Level Sets methods. Fast Marching allows se...
Thomas Deschamps, Laurent D. Cohen
VISSYM
2007
14 years 6 days ago
Model-free Surface Visualization of Vascular Trees
Expressive and efficient visualizations of complex vascular structures are essential for medical applications, such as diagnosis and therapy planning. A variety of techniques has ...
Christian Schumann, Steffen Oeltze, Ragnar Bade, B...
UAI
2008
13 years 11 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash