Browsing Mathematics (Faculty of) by Title
Now showing items 11551174 of 2993

gLOP: A Cleaner Dirty Model for Multitask Learning
(University of Waterloo, 20140822)Multitask learning (MTL) was originally defined by Caruana (1997) as "an approach to inductive transfer that improves learning for one task by using the information contained in the training signals of other related tasks". ... 
Goldberg's conjecture is true for random multigraphs
(Elsevier, 201909)In the 70s, Goldberg, and independently Seymour, conjectured that for any multigraph G, the chromatic index χ′(G) satisfies χ′(G) ≤ max{∆(G)+1,⌈ρ(G)⌉}, where ρ(G) = max\{\frac {e(G[S])}{\lfloorS/2\rfloor} \mid S\subseteq ... 
Gradual C Programming for Typed Lua
(University of Waterloo, 20190122)The work presented in this thesis deals with the problem of enhancing the performance of dynamicallytyped programming languages by integrating features from staticallytyped programming languages. Staticallytyped languages ... 
A Gradual NonConvexation Penalty Method for Minimizing VaR
(University of Waterloo, 20120508)This thesis investigates the portfolio optimization problem using ValueatRisk (VaR) as a risk measure, when m sample scenarios are given. Minimizing VaR of a portfolio is computationally difficult: it is nonconvex, ... 
Gradual Pluggable Typing in Java
(University of Waterloo, 20160427)Gradual typing provides the ability to safely mix untyped or dynamically typed code with statically typed code while maintaining, within the statically typed portion, the guarantees claimed by the static typing. It is ... 
Graph C*algebras and the Abelian Core
(University of Waterloo, 20160826)We may associate to a C*algebra to the directed graph E by associating edges to partial isometries and vertices to pairwise orthogonal Hilbert spaces which satisfy some additional conditions. Such graph algebras were first ... 
Graph Coverings with Few Eigenvalues or No Short Cycles
(University of Waterloo, 20230518)This thesis addresses the extent of the covering graph construction. How much must a cover X resemble the graph Y that it covers? How much can X deviate from Y? The main statistics of X and Y which we will measure are their ... 
Graph Editing to a Given Neighbourhood Degree List is FixedParameter Tractable
(University of Waterloo, 20161026)Graph editing problems have a long history and have been widely studied, with applications in biochemistry and complex network analysis. They generally ask whether an input graph can be modified by inserting and deleting ... 
Graph Morphing via Orthogonal Box Drawings
(University of Waterloo, 20231218)Abstract: A graph is a set of vertices, with some pairwise connections given by a set of edges. A graph drawing, such as a nodelink diagram, visualizes a graph with geometric features. One of the most common forms of a ... 
GraphBased Fracture Models for Rigid Body Explosions
(University of Waterloo, 2005)Explosions are one of the most powerful and devastating natural phenomena. The pressure front from the blast wave of an explosion can cause fracture of objects in its vicinity and create flying debris. In this thesis, ... 
GraphBased Mapping for Knowledge Transfer in General Game Playing
(University of Waterloo, 20240117)General game playing (GGP) is a field of reinforcement learning (RL) in which the rules of a game (i.e. the state and dynamics of an RL domain) are not specified until runtime. A GGP agent must therefore be able to play ... 
GraphBased SpatialTemporal Cluster Evolution: Representation, Analysis, and Implementation
(University of Waterloo, 20230828)Spatialtemporal data are information about realworld entities that exist in a location, the spatial dimension, and during a period of time, the temporal dimension. These realworld entities, such as vehicles, people, or ... 
Graphtheoretic Properties of Control Flow Graphs and Applications
(University of Waterloo, 20150825)This thesis deals with determining appropriate width parameters of control flow graphs so that certain computationally hard problems of practical interest become efficiently solvable. A wellknown result of Thorup states ... 
GraphTheoretic Techniques for Optimizing NISQ Algorithms
(University of Waterloo, 20240215)Entering the NISQ era, the search for useful yet simple quantum algorithms is perhaps of more importance now than it may ever be in the future. In place of quantum walks, the quantum Fourier transform, and asymptotic results ... 
GraphflowDB: Scalable Query Processing on GraphStructured Relations
(University of Waterloo, 20231002)Finding patterns over graphstructured datasets is ubiquitous and integral to a wide range of analytical applications, e.g., recommendation and fraud detection. When expressed in the highlevel query languages of database ... 
Graphical CSS Code Transformation Using ZX Calculus
(University of Waterloo, 20231221)In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phasefree ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps ... 
The Graphs of HU+00E4ggkvist & Hell
(University of Waterloo, 20090119)This thesis investigates HU+00E4ggkvist & Hell graphs. These graphs are an extension of the idea of Kneser graphs, and as such share many attributes with them. A variety of original results on many different properties of ... 
Green’s Function for Poisson Equation in Layered NanoStructures including Graphene
(University of Waterloo, 20150504)The purpose of this thesis is to focus on the electrostatic properties of graphenebased nanostructures consisting of different materials, as well as their interactions with external electric charges, by solving the boundary ... 
Grey Level Visual Cryptography for General Access Structures
(University of Waterloo, 2002)Visual cryptography, first introduced by Naor and Shamir, allows a secret (black and white) image to be encoded and distributed to a set of participants such that certain predefined sets of participants may reconstruct the ... 
A Grouped Hamming Network
(University of Waterloo, 20100830)A distributed hash table (DHT) is a type of peertopeer (P2P) network that, like traditional hash tables, maps keys to values. Unlike traditional hash tables, however, the data is distributed across a network with each ...