Convergence of Adaptive Direction Sampling
β Scribed by G.O. Roberts; W.R. Gilks
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 476 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0047-259X
No coin nor oath required. For personal study only.
β¦ Synopsis
We consider the convergence of adaptive direction sampling, concentrating mainly on a special case, the "snooker algorithm" for which a powerful irreducibility result can be proved under extremely mild regularity conditions. ic) 1994 Academic Press, Inc.
π SIMILAR VOLUMES
The initial setting and maintaining of the desired paper basis weight (in machine direction and cross direction) is to be ensured adaptively for several given paper grades. Technical equipment includes: usual traversing gauge at the output of the paper machine, special traversing robot for shaping
This paper analyzes the asymptotic properties of a classical algorithm: the adaptative sampling which solves the following problem; how to estimate the number M of distinct elements of a large collection of n data. Using tools such as the random tree and techniques such as Mellin transforms, combina