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 20 of 2384 for “"covering"”.
-
Covering Systems
… one of the congruences, is said to be a set of covering congruences, or covering system. A famous conjecture of Erdos from 1950 states that the least modulus of a covering system can be arbitrarily large. This conjecture remains open, and, in its full strength, appears at present to be …
-
Divergence Covering
… problem of interest is that of finding covering numbers. A very important measure between probability distributions is Kullback-Leibler (KL) divergence. Both topics have been massively studied in various contexts, and in this thesis we focus on studying the problem when the two concepts …
-
On Covering: Queerness
… oppression, a larger problem has gone unnoticed: covering. Covering differs from passing as one's membership to a marginalized community is now background knowledge in any social interaction where one may cover. Covering, then, depicts the intentional editing of one's behavior to modify the way in …
-
Semantic Decomposition By Covering
This thesis describes the implementation of a covering algorithm for semantic decomposition of sentences of technical patents. This research complements the ASPIN project that has a long term goal of providing an automated system for digital system synthesis from patents. In order to develop a …
-
Covering Sets of the Integers
Made available in DSpace on 2014-12-11T18:23:43Z (GMT). No. of bitstreams: 1 7121162.pdf: 3349128 bytes, checksum: ff4e647d59c04f1ac0287e0172b96651 (MD5) Previous issue date: 1971
-
Separation and covering properties of frames
… in the frame setting and relate these to frame covering properties. Finally, a determination of which covering properties and separation axioms imply spatiality of a frame is made.
-
Residually finite properties of covering spaces
The purpose of this thesis is trying to construct some negative results for Griffith’s theorem 1 in (3) by showing theorem 1.1 and a counter-example in Section 2. I also give some general positive results for this work in Section 3, to go with the negative ones. It is well known that Fuchsian …
-
Coloring and covering problems on graphs
The \emph{separation dimension} of a graph $G$, written $\pi(G)$, is the minimum number of linear orderings of $V(G)$ such that every two nonincident edges are ``separated'' in some ordering, meaning that both endpoints of one edge appear before both endpoints of the other. We introduce the …
-
On Learning and Covering Structured Distributions
… a number of problems related to learning and covering structured distributions: Hypothesis Selection: We provide an improved and generalized algorithm for selecting a good candidate distribution from among competing hypotheses. Namely, given a collection of ... hypotheses containing at least …
-
Covering problem with minimum radius enclosing circle
This study extends the classical smallest enclosing circle problem in location science to optimize healthcare communication hubs. Given a set of demand points and potential groups, we identify the optimal number of subgroups to cover all points and the circle enclosing them with minimum radius. The …
-
Generalized total and partial set covering problems
… with the development of two generalized set covering models. The first model is formulated for the total set covering problem where cost is minimized subject to the constraint that each customer must be served by at least one facility. The second model is constructed for the partial set …
-
Well-covered Graphs, Unique Colorability, and Covering Range
… graphs that generalizes the k-trees. </p> <p>The covering range of a graph is the difference between the cardinality of a largest maximal independent set of a graph and the cardinality of a smallest maximal independent set of the graph. We give the covering range for some cubic graphs and a class …
-
Covering Systems of Polynomial Rings Over Finite Fields
… moduli. He called such systems of congruences covering systems. Utilizing his covering system, he disproved a conjecture of de Polignac asking, “for every odd k, is there a prime of the form 2n + k?” Examples of covering systems of the integers are presented along with some brief history and a …
-
Extremal Problems in Combinatorics: Covering and Coloring Problems
The Ramsey-type coloring problems we consider include generalized Ramsey and generalized Anti-Ramsey problems. Namely, what is the minimal (or maximal) number of colors on the edges of a graph such that every subgraph isomorphic to some fixed graph uses at most q2 and at least q1 colors on its …
-
On the problem of parallelizing manifold covering algorithms
Continuation methods are numerical algorithms used to determine the solution space of systems of nonlinear equations with associated sets of parameters. Such methods have been very successful in computing solution manifolds of dimension one. For higher dimensional manifolds, different techniques …
Page 1 of 120