Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Covering numbers"”.

  1. On Ideals Related to Compact Tree Forcings and Their Covering Numbers

    We investigate the ideals on the space of the reals that are associated with the classical forcing notions of Sacks and Silver and the closely related Mycielski ideals. We prove that (with one exception) no non-trivial inclusion between any pair of ideals is provable in ZFC. Continuing the work of …

    cau-kiel Repository record for On Ideals Related to Compact Tree Forcings and Their Covering Numbers (opens in a new tab)

  2. On Covering Groups With Proper Subgroups

    … expressed as a union of proper subgroups. Using “covering number” to denote the minimal number of proper subgroups required to cover a group, we explore the nature of groups with covering numbers 3 and 4, while also finding covering numbers for p-groups, dihedral, and generalized dihedral groups.

    mo-state Repository record for On Covering Groups With Proper Subgroups (opens in a new tab)

  3. Γεωμετρία των L_q κεντροειδών σωμάτων

    … the L_q centroid bodies. We give upper bound of covering numbers of the eucledian ball of the L_q centroid bodies and as a consiquense we give upper bound the averange norm of L_q centroid bodies. Finally we get upper bound of a isotropic convex body. In the fifth chapter we give upper bound of …

    greece Repository record for Γεωμετρία των L_q κεντροειδών σωμάτων (opens in a new tab)

  4. Some problems in combinatorial geometry

    … theorem that the vertex-stability and vertex-covering numbers of a graph G sum to the number of vertices of G.</p> <p>The Tutte polynomial of a graph is known to be related to the bond percolation model on the graph. In Chapter 5 we introduce a basic abstraction of classical percolation …

    oxford Repository record for Some problems in combinatorial geometry (opens in a new tab)

  5. Benefits of Additive Noise in Composing Classes of Functions with Applications to Neural Networks

    … small capacities as measured by their uniform covering numbers, the capacity of the composition class H o F={h o f| f in F, h in H} can become prohibitively large or even unbounded. To this end, in this thesis we provide a framework for controlling the capacity of composition and extend our …

    mcmaster Repository record for Benefits of Additive Noise in Composing Classes of Functions with Applications to Neural Networks (opens in a new tab)

  6. Eccentric sets

    … of low-dimensional sets, and I investigate the covering numbers of these ideals.

    whiterose Download PDF for Eccentric sets (opens in a new tab)

  7. On the risk of the nearest neighbor rules

    The main contents of this thesis are summarized as follows: Based on an exact integral expression for the risk, we find an asymptotic evaluation of the conditional risk for unbounded support. Then the problems and the applicability of integrating these asymptotic expansions are discussed. This if …

    cau-kiel Repository record for On the risk of the nearest neighbor rules (opens in a new tab)