Sciweavers

72 search results - page 12 / 15
» Hierarchical Correctness Proofs for Distributed Algorithms
Sort
View
CIKM
1997
Springer
13 years 11 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
Jie Cheng, David A. Bell, Weiru Liu
EUROPAR
2004
Springer
14 years 23 days ago
A Data Management and Communication Layer for Adaptive, Hexahedral FEM
The parallel realization of adaptive finite element methods (FEM) has to deal with several irregular and dynamic algorithmic properties caused by adaptive mesh refinement (AMR). ...
Judith Hippold, Gudula Rünger
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
14 years 2 months ago
On Making Directed Graphs Transitive
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
IJON
2010
138views more  IJON 2010»
13 years 5 months ago
A dynamic Bayesian network to represent discrete duration models
Originally devoted to specific applications such as biology, medicine and demography, duration models are now widely used in economy, finance or reliability. Recent works in var...
Roland Donat, Philippe Leray, Laurent Bouillaut, P...
CORR
2010
Springer
183views Education» more  CORR 2010»
13 years 7 months ago
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
Alok Ojha, Hongmei Deng, Dharma P. Agrawal, Sugata...