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 10 of 10 for “"Covering Number"”.
-
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 …
-
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.
-
Packing and Covering Odd (u,v)-trails in a Graph
… we investigate the problem of packing and covering odd $(u,v)$-trails in a graph. A $(u,v)$-trail is a $(u,v)$-walk that is allowed to have repeated vertices but no repeated edges. We call a trail \emph{odd} if the number of edges in the trail is odd. Given a graph $G$ and two specified …
-
Optimization on products of combinatorial structures
… structures with a product form. The independence number of a graph G, denoted $\alpha (G)$, is the size of the largest independent set in G, where a subset S of the vertex set V(G) is independent if no two vertices in S are adjacent in G. The clique covering number of G, denoted $\Theta (G)$, is …
-
The additivity of the two-dimensional Miller ideal
… that the additivity of J(M^2) is bigger than the covering number of the ideal of the meager subsets of the Baire space. We also show that Martin's Axiom implies that the additivity of J(M^2) is the cardinality of the continuum. Finally we prove that there are no analytical infinite maximal …
-
Mobile Guards’ Strategies for Graph Surveillance and Protection
… Our algorithm further determines the maximum number of attacks (potentially infinite) the guards can defend from each configuration. We study the relationship between the eternal domination number of a graph and its clique covering number using both large-scale computation and analytic …
-
Secure paired domination in graphs
… of the secure paired domination (SPD) numbers associated with the definitions. Based on each of the nine definitions, the SPD numbers of five types of special graphs, namely paths, cycles, spiders, ladders and grid graphs, are studied. We then compare the SPD number of an arbitrary …
-
Graph partitions and the bichromatic number
… independent sets and l cliques. The bichromatic number chi^b of a graph is the minimum r$ such that the graph is (k,l)-colourable for all k+l=r. The bichromatic number is related to the cochromatic number, which can also be defined in terms of (k,l)-colourings. The bichromatic number is a fairly …
-
NEURAL NETWORKS MODELS WITH APPLICATIONS TO GENETIC STUDIES
… no effects on diseases and fitting NN on a large number of variants without considering the underlying genetic structure (e.g., linkage disequilibrium) could bring a serious overfitting issue. Furthermore, while a single disease phenotype is often studied in a classic genetic study, in emerging …
-
Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality
… pairs of points at distance one. The hypersphere number of $G$, denoted by $t(G)$, is the (square of the) minimum radius of a hypersphere that contains a unit-distance representation of $G$. Lovasz proved a min-max relation describing $t(G)$ as a function of $\vartheta(\overline{G})$, the theta …