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

Efficient distributed approximation algorithms via probabilistic tree embeddings

โœ Scribed by Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar

Book ID
113044088
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
416 KB
Volume
25
Category
Article
ISSN
0178-2770

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