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

Indexing scheme for classes of N; partitions of N

โœ Scribed by Britt Friis-Jensen; Sten Rettrup; C. R. Sarma

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
167 KB
Volume
64
Category
Article
ISSN
0020-7608

No coin nor oath required. For personal study only.

โœฆ Synopsis

The classes of the symmetric group S S are identified by partitions of N.

N

In this work an indexing scheme is presented which provides a dense enumeration of the classes of S S . The method is based on a graphical representation of partitions of N, N which also enables the determination of the class corresponding to a given number.

๐Ÿ“œ SIMILAR VOLUMES

Characterizations of Learnability for Cl
Characterizations of Learnability for Classes of {0, ..., n)-Valued Functions
โœ S. Bendavid; N. Cesabianchi; D. Haussler; P.M. Long ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 885 KB

We investigate the PAC learnability of classes of \(\{0, \ldots, n\}\)-valued functions \((n<\infty)\). For \(n=1\) it is known that the finiteness of the Vapnik-Chervonenkis dimension is necessary and sulficient for learning. For \(n>1\) several generalizations of the VC-dimension, each yielding a