Sciweavers

1640 search results - page 7 / 328
» Conditional Independence Trees
Sort
View
JMLR
2010
102views more  JMLR 2010»
13 years 4 months ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...
AI
2006
Springer
14 years 1 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch
ICCAD
2007
IEEE
139views Hardware» more  ICCAD 2007»
14 years 4 months ago
Using functional independence conditions to optimize the performance of latency-insensitive systems
—In latency-insensitive design shell modules are used to encapsulate system components (pearls) in order to interface them with the given latency-insensitive protocol and dynamic...
Cheng-Hong Li, Luca P. Carloni
BMCBI
2010
147views more  BMCBI 2010»
13 years 10 months ago
Learning biological network using mutual information and conditional independence
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...
Dong-Chul Kim, Xiaoyu Wang, Chin-Rang Yang, Jean G...
WEBI
2001
Springer
14 years 2 months ago
On Axiomatizing Probabilistic Conditional Independencies in Bayesian Networks
Several researchers have suggested that Bayesian networks (BNs) should be used to manage the inherent uncertainty in information retrieval. However, it has been argued that manuall...
Cory J. Butz