Sciweavers

813 search results - page 114 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
SPAA
1998
ACM
14 years 2 days ago
Elimination Forest Guided 2D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
Kai Shen, Xiangmin Jiao, Tao Yang
NN
1997
Springer
174views Neural Networks» more  NN 1997»
14 years 6 hour ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
BIRTHDAY
2008
Springer
13 years 10 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Networks
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
Robert Mateescu, Rina Dechter
IADIS
2004
13 years 9 months ago
From XML Schema to Object-Relational Database - An XML Schema-Driven Mapping Algorithm
Since XML becomes a crucial format for representing information, it is necessary to establish techniques for managing XML documents. A possible solution can be found in storing XM...
Irena Mlynkova, Jaroslav Pokorný
JMLR
2010
102views more  JMLR 2010»
13 years 2 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...