Sciweavers

94 search results - page 12 / 19
» Modeling changing dependency structure in multivariate time ...
Sort
View
70
Voted
CGF
2008
110views more  CGF 2008»
14 years 9 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 9 months ago
Settling the Polynomial Learnability of Mixtures of Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
Ankur Moitra, Gregory Valiant
GLVLSI
2000
IEEE
87views VLSI» more  GLVLSI 2000»
15 years 1 months ago
Speeding up symbolic model checking by accelerating dynamic variable reordering
Symbolic Model checking is a widely used technique in sequential verification. As the size of the OBDDs and also the computation time depends on the order of the input variables,...
Christoph Meinel, Christian Stangier
AI
2002
Springer
14 years 9 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
79
Voted
FMSD
2006
85views more  FMSD 2006»
14 years 9 months ago
Distributed disk-based algorithms for model checking very large Markov chains
In this paper we present data structures and distributed algorithms for CSL model checking-based performance and dependability evaluation. We show that all the necessary computatio...
Alexander Bell, Boudewijn R. Haverkort