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

Improved Bounds on the Union Complexity of Fat Objects

โœ Scribed by Mark de Berg

Publisher
Springer
Year
2007
Tongue
English
Weight
417 KB
Volume
40
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improved Bounds on the Sample Complexity
Improved Bounds on the Sample Complexity of Learning
โœ Yi Li; Philip M. Long; Aravind Srinivasan ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 137 KB

We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimates is measured using a variant of the relative error proposed by Haussler and Pollard. We also show that our bound is wit

On the Kolmogorov Complexity of Arbitrar
On the Kolmogorov Complexity of Arbitrary Objects
โœ Aaron Shenhar ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 795 KB

The notion of Kolmogorov program-size complexity (or algorithmic information) is defined here for arbitrary objects. Using a special form of recursive topological spaces, called partition spaces, we define a recursive topology which uses a level of partition for approximation of arbitrary objects in