Now showing items 1155-1174 of 2993

    • gLOP: A Cleaner Dirty Model for Multitask Learning 

      Rose, Rhiannon (University of Waterloo, 2014-08-22)
      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 

      Haxell, Penny; Krivelevich, Michael; Kronenberg, Gal (Elsevier, 2019-09)
      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])}{\lfloor|S|/2\rfloor} \mid S\subseteq ...
    • Gradual C Programming for Typed Lua 

      Turas, Rafi (University of Waterloo, 2019-01-22)
      The work presented in this thesis deals with the problem of enhancing the performance of dynamically-typed programming languages by integrating features from statically-typed programming languages. Statically-typed languages ...
    • A Gradual Non-Convexation Penalty Method for Minimizing VaR 

      Xi, Jiong (University of Waterloo, 2012-05-08)
      This thesis investigates the portfolio optimization problem using Value-at-Risk (VaR) as a risk measure, when m sample scenarios are given. Minimizing VaR of a portfolio is computationally difficult: it is non-convex, ...
    • Gradual Pluggable Typing in Java 

      Brotherston, Daniel, Scott (University of Waterloo, 2016-04-27)
      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 

      Eifler, Kari (University of Waterloo, 2016-08-26)
      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 

      Levit, Maxwell (University of Waterloo, 2023-05-18)
      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 Fixed-Parameter Tractable 

      Subramanya, Vijay (University of Waterloo, 2016-10-26)
      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 

      Spalding-Jamieson, Jack (University of Waterloo, 2023-12-18)
      Abstract: A graph is a set of vertices, with some pairwise connections given by a set of edges. A graph drawing, such as a node-link diagram, visualizes a graph with geometric features. One of the most common forms of a ...
    • Graph-Based Fracture Models for Rigid Body Explosions 

      Socha, Jessica (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, ...
    • Graph-Based Mapping for Knowledge Transfer in General Game Playing 

      Jung, Joshua (University of Waterloo, 2024-01-17)
      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 ...
    • Graph-Based Spatial-Temporal Cluster Evolution: Representation, Analysis, and Implementation 

      da Silva Portugal, Ivens (University of Waterloo, 2023-08-28)
      Spatial-temporal data are information about real-world entities that exist in a location, the spatial dimension, and during a period of time, the temporal dimension. These real-world entities, such as vehicles, people, or ...
    • Graph-theoretic Properties of Control Flow Graphs and Applications 

      Kumar, Neeraj (University of Waterloo, 2015-08-25)
      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 well-known result of Thorup states ...
    • Graph-Theoretic Techniques for Optimizing NISQ Algorithms 

      Jena, Andrew (University of Waterloo, 2024-02-15)
      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 Graph-Structured Relations 

      Mhedhbi, Amine (University of Waterloo, 2023-10-02)
      Finding patterns over graph-structured datasets is ubiquitous and integral to a wide range of analytical applications, e.g., recommendation and fraud detection. When expressed in the high-level query languages of database ...
    • Graphical CSS Code Transformation Using ZX Calculus 

      Li, Sarah Meng (University of Waterloo, 2023-12-21)
      In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps ...
    • The Graphs of HU+00E4ggkvist & Hell 

      Roberson, David E. (University of Waterloo, 2009-01-19)
      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 Nano-Structures including Graphene 

      Kang, Naijing (University of Waterloo, 2015-05-04)
      The purpose of this thesis is to focus on the electrostatic properties of graphene-based 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 

      MacPherson, Lesley (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 

      Logan, Bryan (University of Waterloo, 2010-08-30)
      A distributed hash table (DHT) is a type of peer-to-peer (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 ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages