✦ LIBER ✦

A new algorithm for computing the Geronimus transformation with large shifts

✍ Scribed by Maria Isabel Bueno Cachadina; Alfredo Deaño; Edward Tavernetti

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 585 KB
Volume: 54
Category: Article
ISSN: 1017-1398
DOI: 10.1007/s11075-009-9325-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new algorithm for the Lie transformati

A new algorithm for the Lie transformation

✍ William A. Mersman 📂 Article 📅 1970 🏛 Springer Netherlands 🌐 English ⚖ 306 KB

A new subdivision for computing fixed po

A new subdivision for computing fixed points with a homotopy algorithm

✍ G. van der Laan; A. J. J. Talman 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 819 KB

A new algorithm to compute the discrete

A new algorithm to compute the discrete inverse radon transform

✍ Joseph Segman 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 283 KB

A fast computational algorithm for the L

A fast computational algorithm for the Legendre-Fenchel transform

✍ Y. Lucet 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 857 KB

A New Efficient Algorithm for Computing

A New Efficient Algorithm for Computing the Longest Common Subsequence

✍ Costas S. Iliopoulos; M. Sohel Rahman 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 444 KB

A Shift Algorithm for Exact Computation

A Shift Algorithm for Exact Computation in Sequential Tests with Binary Outcome

✍ Josef Högel 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 2 views

A simple shift algorithm is described enabling the exact determination of power functions and sample size distributions for a large variety of closed sequential two-sample designs with a binary outcome variable. The test statistics are assumed to be based on relative frequencies of successes or fail