๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Testing the correctness of the sequential algorithm for simulating Gaussian random fields

โœ Scribed by X. Emery

Publisher
Springer
Year
2004
Tongue
English
Weight
510 KB
Volume
18
Category
Article
ISSN
1436-3240

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the correct convergence of the EM alg
On the correct convergence of the EM algorithm for Gaussian mixtures
โœ Jinwen Ma; Shuqun Fu ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 235 KB

It is well-known that the EM algorithm generally converges to a local maximum likelihood estimate. However, there have been many evidences to show that the EM algorithm can converge correctly to the true parameters as long as the overlap of Gaussians in the sample data is small enough. This paper st

A simulated annealing algorithm with the
A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs
โœ Taichi Kaji; Azuma Ohuchi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 240 KB

In this paper, we present an approach for ยฎnding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satisยฎed, based on the concept of simulated annealing. Simulated anneali