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 223 for “"decompositions"”.
-
Branch decompositions and their applications
… and bound while another method is by graph decompositions. In the 1980's, Robertson and Seymour conceived of two new ways to decompose the graph in order to solve these problems. These ingenious ideas were only by-products of their work proving Wagner's Conjecture. A branch decomposition is …
-
Width functions for hypertree decompositions
… terms of the cardinalities of the pieces of tree-decompositions. Hypertree-width can be understood as a variant of tree-width which results from applying a measure other than cardinality to the pieces. This idea gives rise to a unifying framework (f-hypertree-width) for tree-width, hypertree-width …
-
Statistical Mechanics of Unimolecular Decompositions
Made available in DSpace on 2014-12-09T17:34:59Z (GMT). No. of bitstreams: 1 6500857.pdf: 1756049 bytes, checksum: 274050e9dba5c26a469a8a08b9fe9023 (MD5) Previous issue date: 1964
-
The combinatorics of reduced decompositions
This thesis examines several aspects of reduced decompositions in finite Coxeter groups. Effort is primarily concentrated on the symmetric group, although some discussions are subsequently expanded to finite Coxeter groups of types B and D. In the symmetric group, the combined frameworks of …
-
Syzygy Decompositions and Projective Resolutions
… The description of this resolution is related to decompositions of the first syzygy module of 𝛬 as an 𝛬<SUP>𝑒</SUP> module. Resolutions of right 𝛬 modules 𝑀<SUB>𝛬</SUB> may be obtained by tensoring 𝑀 over 𝛬 with this bimodule resoution. We describe how to obtain such a resolution when 𝑀 is simple …
-
Proper decompositions of finitely presented groups
… the main conjecture of A.N.Bartholomew's Proper Decompositions Of Finitely Presented Groups (1987), that the sum of two tracks giving trivial decompositions gives a trivial decomposition itself, was discovered. A proof is given using Bass-Serre theory on a certain class of groups that if every …
-
Algorithms for structural learning with decompositions
Structured prediction describes problems which involve predicting multiple output variables with expressive and complex interdependencies and constraints. Learning over expressive structures (called structural learning) is usually time-consuming as exploring the structured space can be an …
-
Isotopic Tracer Studies of Organic Peroxide Decompositions
Made available in DSpace on 2014-12-05T19:38:00Z (GMT). No. of bitstreams: 1 6206130.pdf: 4744222 bytes, checksum: 9d7225c2d543c3ca3c4577b467a576d0 (MD5) Previous issue date: 1962
-
Algorithms and software for efficient tensor decompositions
… and scalable software for efficient tensor decompositions, with a focus on real-world applications. On the algorithmic front, we introduce accurate and scalable methods for computing various types of tensor decompositions under diverse data assumptions. On the software side, we design …
-
Decompositions of Free Energies in Molecular Simulation
This thesis describes advances in methods to measure free energy changes in simulations of molecular systems. In each case the free energy is decomposed into local environments which reveal insights about the complex systems being studied. Free energy is a fundamental quantity that can be used to …
-
Geometric Decompositions and Networks - Approximation Bounds and Algorithms
In this thesis we focus on four problems in computational geometry: In the first four chapters we consider the problem of covering an arbitrary polygon with simpler polygons, i.e., rectangles. We present several approximation algorithms for this problem, and also some lower bounds on the number of …
-
Accelerated Least Squares Network Adjustments and Graph Decompositions
… second phase of this project, we review graph decompositions and find a cut decomposition which nearly meets the requirement of the Helmert Blocking method. We elaborate on the cut decomposition to create a block decomposition which is more suitable for the Helmert Blocking method. We also …
-
Probabilistic Approximations of Matrix Decompositions for Inverse Problems
… A particular focus is approximate matrix decompositions. This thesis makes use of the Sherman-Morrison-Woodbury formula/matrix inversion lemma, Schur Complements, pseudoinverses, the eigenvalue decomposition, the singular value decomposition, the Cholesky decomposition and particularly the …
-
On Hopf Algebra Type and Rational Calculus Decompositions
The second part of my thesis, which is joint work with Randy McCarthy, uses Goodwillie calculus to extend this result to a much larger class of functors. A Hopf algebra A is both an algebra with a multiplication map m:A⊗A→ A and a coalgebra with a comultiplication map D: …
-
Decompositions of Finite Rank, Torsion-Free Abelian Groups
Made available in DSpace on 2014-12-11T18:23:43Z (GMT). No. of bitstreams: 1 7121096.pdf: 986182 bytes, checksum: f0edf9aa94b9e58f29d3eeddb4f1c694 (MD5) Previous issue date: 1971
-
Solvent Cage Effects in Aliphatic Diacyl Peroxide Decompositions
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1969.
-
Low rank decompositions for sum of squares optimization
In this thesis, we investigate theoretical and numerical advantages of a novel representation for Sum of Squares (SOS) decomposition of univariate and multivariate polynomials. This representation formulates a SOS problem by interpolating a polynomial at a finite set of sampling points. As compared …
Page 1 of 12