2036 search results - page 36 / 408 » From Sampling to Model Counting |
116
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
SIGGRAPH
2000
ACM
15 years 5 months ago
2000
ACM
Traditional collision intensive multi-body simulations are difficult to control due to extreme sensitivity to initial conditions or model parameters. Furthermore, there may be mu...
103
click to vote
TSP
2010
14 years 8 months ago
2010
Both direct and indirect methods exist for identifying continuous-time linear systems. A direct method estimates continuous-time input and output signals from their samples and the...
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Estimation of distribution algorithms replace the typical crossover and mutation operators by constructing a probabilistic model and generating offspring according to this model....
116
click to vote
JMLR
2006
15 years 1 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...