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

An O(n log n) unidirectional distributed algorithm for extrema finding in a circle

โœ Scribed by Danny Dolev; Maria Klawe; Michael Rodeh

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
997 KB
Volume
3
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An O(nlog log n) Learning Algorithm for
An O(nlog log n) Learning Algorithm for DNF under the Uniform Distribution
โœ Y. Mansour ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 571 KB

We show that a DNF with terms of size at most \(d\) can be approximated by a function at most \(d^{O(d \log 1 / \epsilon)}\) nonzero Fourier coefficients such that the expected error squared, with respect to the uniform distribution, is at most \(\epsilon\). This property is used to derive a learnin