Sciweavers

1722 search results - page 184 / 345
» On the sample mean of graphs
Sort
View
CSDA
2010
118views more  CSDA 2010»
15 years 6 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
Mathematical analysis of the recoil growth algorithm to generate multi-polymer systems
The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. While the ...
F. Simatos
CGF
2005
111views more  CGF 2005»
15 years 6 months ago
Pinchmaps: textures with customizable discontinuities
We introduce a new texture representation that combines standard sampling, to be bilinearly interpolated in smoothly varying regions, with customizable discontinuities, to model s...
Marco Tarini, Paolo Cignoni
CORR
2010
Springer
228views Education» more  CORR 2010»
15 years 5 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 5 months ago
Learning Networks of Stochastic Differential Equations
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
José Bento, Morteza Ibrahimi, Andrea Montan...