𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic analysis of adaptative sampling

✍ Scribed by Guy Louchard


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
174 KB
Volume
10
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

✦ Synopsis


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, combinatorial identities on Stirling numbers and Bessel functions, we analyze all moments and the asymptotic distribution function of the Ε½ .


πŸ“œ SIMILAR VOLUMES


Convergence of Adaptive Direction Sampli
✍ G.O. Roberts; W.R. Gilks πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 476 KB

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.

Stoer-Bulirsch adaptive frequency sampli
✍ J. Q. Chen; R. S. Chen; Z. W. Liu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 91 KB

## Abstract In this article, a Stoer‐Bulirsch adaptive frequency sampling method is proposed in conjunction with the method of moments to analyze the broadband electromagnetic wave scattering from frequency selective surfaces. On comparing with other sampling methods, the Stoer‐Bulirsch algorithm i

Probabilistic analysis of the time compl
✍ Tadashi Mizoi; Shunji Osaki πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 460 KB

## Abstract Quicksort is a well‐known sorting algorithm based on the divided control. the array to be sorted is divided into two sets as follows. an element in the array is specified, and the set of values larger than the value of that element and the set of values smaller than that value are const