Sciweavers

2479 search results - page 477 / 496
» Random Event Structures
Sort
View
AMAI
2004
Springer
14 years 27 days ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
DIAGRAMS
2004
Springer
14 years 27 days ago
Bayesian Boxes: A Colored Calculator for Picturing Posteriors
The need for Bayesian inference arises in military intelligence, medical diagnosis and many other practical applications. The problem is that human inferences are generally conserv...
Kevin Burns
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
14 years 27 days ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
FSTTCS
2004
Springer
14 years 26 days ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
WAC
2004
Springer
149views Communications» more  WAC 2004»
14 years 25 days ago
BIONETS: BIO-inspired NExt generaTion networkS
The amount of information in the new emerging all-embracing pervasive environments will be enormous. Current Internet protocol conceived almost forty years ago, were never planned ...
Iacopo Carreras, Imrich Chlamtac, Hagen Woesner, C...