11 search results - page 2 / 3 » Using Theorem Proving to Verify Expectation and Variance for... |
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
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...
ASM
2010
ASM
13 years 10 months ago
2010
ASM
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time ...
UAI
2004
13 years 6 months ago
2004
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...