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 31 for “"combinatorial methods"”.
-
Combinatorial Methods in Statistics
This thesis explores combinatorial methods in random vector balancing, nonparametric estimation, and network inference. First, motivated by problems from controlled experiments, we study random vector balancing from the perspective of discrepancy theory, a classical topic in combinatorics, and give …
-
An Application of Combinatorial Methods
… likely. Probability theory is simply enumerative combinatorial analysis when applied to finite sets. For a given finite sample space, probability questions are usually "just" a lot of counting. The purpose of this thesis is to provide some in depth analysis of several combinatorial methods, …
-
Combinatorial methods in multilinear algebra
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1993.
-
Machine learning and combinatorial methods for discrete optimization problems
Combinatorial optimization is a central field of discrete mathematics, concerned with finding optimal solutions to problems over combinatorial structures such as graphs or set systems. However, while classical combinatorial optimization assumes complete knowledge of all problem parameters, …
-
Combinatorial methods in number theory: Sieve theory and special functions
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms
-
Combinatorial Methods in the Representation Theory of the Symmetric Group
… of the symmetric group can be carried out from a combinatorial point of view, avoiding the machinery of the representation theory of algebraic groups. This approach has the benefit of providing more insight into the subject as the study remains in the setting of the symmetric group. A number of …
-
Combinatorial approaches to integer sequences
Combinatorial methods are used to prove several results in number theory. The chapters may be read independently, and are briefly discussed below.
-
Finite Subdivision Rules from Matings of Quadratic Functions: Existence and Constructions
Combinatorial methods are utilized to examine preimage iterations of topologically glued polynomials. In particular, this paper addresses using finite subdivision rules and Hubbard trees as tools to model the dynamic behavior of mated quadratic functions. Several methods of construction of …
-
Knot complements and 3-manifolds
… as a compact 3-manifold. We will also apply some combinatorial methods in three-manifold topology to the study of the presentation of the knot complement.
-
A Separator-Based Framework for Graph Matching Problems
… and n vertices, there are known, long-standing combinatorial algorithms that compute a maximum cardinality matching in O(m\sqrt{n}) time. For graphs with non-negative integer edge costs at most C, it is known how to compute a minimum-cost maximum cardinality matching in roughly O(m\sqrt{n} …
-
Some combinatorial aspects in algebraic topology and geometric group theory
… directly available, or subject to differerent methods. In fact combinatorial methods have been preferred and the result is a self-contained dissertation on the theory of the fundamental group and of the coverings. Finally, there are some recent problems in geometric group theory which are …
-
Chalcogenide thin film materials for next generation data storage
… change system, GeSbTe, has been used to test combinatorial deposition techniques and high throughput characterisation methodologies. An optical system, the static tester, was developed to test the time necessary for phase transitions. The system, capable of automated operation, can …
-
On quasi-categories as a foundation for higher algebraic stacks
… and limits. In doing so, we employ exclusively combinatorial methods, as well as adapting an idea of Makkai's ("very subjective morphisms," what turn out in this case to be simply trivial Kan fibrations) to get a handle on various notions of equivalence. We then begin to discuss a new approach …
-
Algorithms for string and graph layout
… some specified objective function. We develop combinatorial methods as well as models based on linear and semidefinite programming for graph layout problems. We apply these techniques to some well-known optimization problems. In particular, we give improved approximation algorithms for the …
-
Quantum-inspired and Quantum Optimization on a Superconducting Quantum Processor
… optimizers with that of several common black-box combinatorial methods. We find that the use of important operations research techniques including the incorporation of domain-specific information as well as state-space pruning improves the performance of all solvers. In addition, we find that in a …
-
High throughput screen for cells with high extracellular metabolite consumption--secretion rates using microfluidic droplets
… such distal genetic factors. IME employs combinatorial methods whereby libraries are constructed harboring random genomic variants of the host or other strains, cells with superior properties are selected, and genetic inserts impacting the superior phenotype are characterized. While many …
-
Towards incorporation of catalytic function into small folded peptide scaffolds
… describes the development of iterative and combinatorial methods for identifying small peptide scaffolds able to support catalytic function. The incorporation of thiamine coenzyme functionality into small peptide scaffolds is achieved through the use of a coenzyme amino acid chimera (Taz). …
-
Modeling and estimation in Gaussian graphical models : maximum-entropy methods and walk-sum analysis
… which differentiates our procedure from standard combinatorial methods. In our approach, we seek the maximum entropy relaxation (MER) within an exponential family, which maximizes entropy subject to constraints that marginal distributions on small subsets of variables are close to the prescribed …
-
Scalable Combinatorial Algorithms for Optimal Transport Based Similarity Metrics
… In this document, we propose to use combinatorial methods to design scalable and noise-resistant solutions for OT. We present four key contributions in this work. First, we introduce a novel combinatorial parallel algorithm for approximating OT, which achieves a parallel time …
-
Geometric Graph Theory and Wireless Sensor Networks
<p>In this work, we apply geometric and combinatorial methods to explore a variety of problems motivated by wireless sensor networks. Imagine sensors capable of communicating along straight lines except through obstacles like buildings or barriers, such that the communication network topology of …
Page 1 of 2