Now showing items 1175-1194 of 3015

    • 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 ...
    • Gröbner Bases Theory and The Diamond Lemma 

      Ge, Wenfeng (University of Waterloo, 2006)
      Commutative Gröbner bases theory is well known and widely used. In this thesis, we will discuss thoroughly its generalization to noncommutative polynomial ring <em>k</em><<em>X</em>> which is also an associative free ...
    • GRS: Combining Generation and Revision in Unsupervised Sentence Simplification 

      Dehghan, Mohammad (University of Waterloo, 2022-08-30)
      Text simplification is a task in the natural language processing field that alters a given text to reduce the structural and lexical complexity of the text while preserving the underlying meaning. We can classify existing ...
    • Guidance Under Uncertainty: Employing a Mediator Framework in Bilateral Incomplete-Information Negotiations 

      Shew, James (University of Waterloo, 2008-09-24)
      Bilateral incomplete-information negotiations of multiple issues present a difficult yet common negotiation problem that is complicated to solve from a mechanism design perspective. Unlike multilateral situations, where ...
    • A guide to F-automatic sets 

      Hawthorne, Christopher (University of Waterloo, 2021-09-08)
      A self-contained introduction to the theory of F-automatic sets is given. Building on [Bell, Moosa, F-sets and finite automata, Journal de théorie des nombres de Bordeaux, 2019], contributions are made to both the foundations ...
    • Guided Testing of Concurrent Programs Using Value Schedules 

      Chen, Jun (University of Waterloo, 2009-09-29)
      Testing concurrent programs remains a difficult task due to the non-deterministic nature of concurrent execution. Many approaches have been proposed to tackle the complexity of uncovering potential concurrency bugs. ...
    • H(div)-conforming Discontinuous Galerkin Methods for Multiphase Flow 

      Booker, Kyle (University of Waterloo, 2021-05-05)
      Computational fluid dynamics (CFD) is concerned with numerically solving and visualizing complex problems involving fluids with numerous engineering applications. Mathematical models are derived from basic governing ...
    • H-colouring Pt-free graphs in subexponential time 

      Groenland, Carla; Okrasa, Karolina; Rzążewski, Paweł; Scott, Alex; Seymour, Paul; Spirkl, Sophie (Elsevier, 2019-08-31)
      A graph is called Pt-free if it does not contain the path on t vertices as an induced subgraph. Let H be a multigraph with the property that any two distinct vertices share at most one common neighbour. We show that the ...
    • H-∞ optimal actuator location 

      Kasinathan, Dhanaraja (University of Waterloo, 2012-05-17)
      There is often freedom in choosing the location of actuators on systems governed by partial differential equations. The actuator locations should be selected in order to optimize the performance criterion of interest. ...

      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