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

An algorithm for approximating conditional probabilities

โœ Scribed by Bryan S. Todd

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
715 KB
Volume
26
Category
Article
ISSN
0020-7101

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improved Algorithms via Approximations o
Improved Algorithms via Approximations of Probability Distributions
โœ Suresh Chari; Pankaj Rohatgi; Aravind Srinivasan ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 235 KB

We present two techniques for constructing sample spaces that approximate probability distributions. The first is a simple method for constructing the small-bias probability spaces introduced by Naor and Naor. We show how to efficiently combine this construction with the method of conditional probab

An Iterated Eigenvalue Algorithm for App
An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials
โœ Steven Fortune ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 655 KB

We discuss an iterative algorithm that approximates all roots of a univariate polynomial. The iteration is based on floating-point computation of the eigenvalues of a generalized companion matrix. With some assumptions, we show that the algorithm approximates the roots within about log ฯ/ ฯ‡(P ) iter

Uniformity of Double Saddlepoint Conditi
Uniformity of Double Saddlepoint Conditional Probability Approximations
โœ John E. Kolassa ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 465 KB

This paper presents results showing that the error involved in using the double saddlepoint distribution function approximations of Skovgaard (1987, J. Appl. Probab. 24 875 887) are uniformly bounded. Particular attention is paid to distributions of sufficient statistics arising from generalized lin