Now showing items 1658-1677 of 2480

    • A PAC-Theory of Clustering with Advice 

      Zokaei Ashtiani, Mohammad (University of Waterloo, 2018-05-17)
      In the absence of domain knowledge, clustering is usually an under-specified task. For any clustering application, one can choose among a variety of different clustering algorithms, along with different preprocessing ...
    • Packing and Covering Odd (u,v)-trails in a Graph 

      Ibrahimpur, Sharat (University of Waterloo, 2016-09-27)
      In this thesis, we investigate the problem of packing and covering odd $(u,v)$-trails in a graph. A $(u,v)$-trail is a $(u,v)$-walk that is allowed to have repeated vertices but no repeated edges. We call a trail \emph{odd} ...
    • Packing Directed Joins 

      Williams, Aaron (University of Waterloo, 2004)
      Edmonds and Giles conjectured that the maximum number of directed joins in a packing is equal to the minimum weight of a directed cut, for any weighted directed graph. This is a generalization of Woodall's Conjecture ...
    • Packing Unit Disks 

      Lafreniere, Benjamin J. (University of Waterloo, 2008-08-27)
      Given a set of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks? Richard Rado conjectured 1/4 and proved 1/4.41. In this thesis, we consider ...
    • Pairs Trading Based on Costationarity 

      Au, Alvin (University of Waterloo, 2015-09-25)
      Arbitrage is a widely sought after phenomenon in financial markets: profit without any risk is very desirable. Statistical arbitrage is a related concept: the idea is to take advantage of market inefficiencies using ...
    • Parallel Paths Analysis Using Function Call Graphs 

      Naeimian, Arman (University of Waterloo, 2019-09-23)
      Call graphs have been used widely in different software engineering areas. Since call graphs provide us with detailed information about the structure of software elements and components and how they are connected with each ...
    • Parallel Pattern Search in Large, Partial-Order Data Sets on Multi-core Systems 

      Ekpenyong, Olufisayo (University of Waterloo, 2011-01-20)
      Monitoring and debugging distributed systems is inherently a difficult problem. Events collected during the execution of distributed systems can enable developers to diagnose and fix faults. Process-time diagrams are ...
    • Parallel Repetition of Prover-Verifier Quantum Interactions 

      Molina Prieto, Abel (University of Waterloo, 2012-01-05)
      In this thesis, we answer several questions about the behaviour of prover-verifier interactions under parallel repetition when quantum information is allowed, and the verifier acts independently in them. We first ...
    • A Parallel Study of the Fock Space Approach to Classical and Free Brownian Motion 

      Hsueh, Kun-Hung (University of Waterloo, 2017-08-28)
      The purpose of this thesis is to elaborate the similarities between the classical and the free probability by means of developing the chaos decomposition of stochastic integrals driven by Brownian motion and its free ...
    • A parallel, adaptive discontinuous Galerkin method for hyperbolic problems on unstructured meshes 

      Giuliani, Andrew (University of Waterloo, 2018-09-04)
      This thesis is concerned with the parallel, adaptive solution of hyperbolic conservation laws on unstructured meshes. First, we present novel algorithms for cell-based adaptive mesh refinement (AMR) on unstructured ...
    • Parameter and Structure Learning Techniques for Sum Product Networks 

      Rashwan, Abdullah (University of Waterloo, 2019-09-25)
      Probabilistic graphical models (PGMs) provide a general and flexible framework for reasoning about complex dependencies in noisy domains with many variables. Among the various types of PGMs, sum-product networks (SPNs) ...
    • A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs 

      Chan, Hubert (University of Waterloo, 2003)
      We can visualize a graph by producing a geometric representation of the graph in which each node is represented by a single point on the plane, and each edge is represented by a curve that connects its two ...
    • Parameterized Code Generation From Template Semantics 

      Prout, Adam (University of Waterloo, 2006)
      We have developed a tool that can create a Java code generator for a behavioural modelling notation given only a description of the notation's semantics as a set of parameters. This description is based on template ...
    • Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations 

      Simjour, Narges (University of Waterloo, 2013-08-30)
      In this thesis, we consider approaches to enumeration problems in the parameterized complexity setting. We obtain competitive parameterized algorithms to enumerate all, as well as several of, the solutions for two related ...
    • Parameterizing a dynamic influenza model using longitudinal versus age-stratified case notifications yields different predictions of vaccine impacts 

      Andrews, Michael A.; Bauch, Chris T. (2018-09-06)
      Dynamic transmission models of influenza are often used in decision-making to identify which vaccination strategies might best reduce influenza-associated health and economic burdens. Our goal was to use laboratory confirmed ...
    • Parking Functions and Related Combinatorial Structures. 

      Rattan, Amarpreet (University of Waterloo, 2001)
      The central topic of this thesis is parking functions. We give a survey of some of the current literature concerning parking functions and focus on their interaction with other combinatorial objects; namely noncrossing ...
    • Particle Clustering and Sub-clustering as a Proxy for Mixing in Geophysical Flows 

      Chakraborty, Rishiraj (University of Waterloo, 2019-08-16)
      The Eulerian point of view is the traditional theoretical and numerical tool to describe fluid mechanics. Some modern computational fluid dynamics codes allow for the efficient simulation of particles, in turn facilitating ...
    • Partition Algebras and Kronecker Coefficients 

      Marcott, Cameron (University of Waterloo, 2015-08-28)
      Classical Schur-Weyl duality relates the representation theory of the general linear group to the representation theory of the symmetric group via their commuting actions on tensor space. With the goal of studying Kronecker ...
    • Partitioning Pauli Operators: in Theory and in Practice 

      Jena, Andrew (University of Waterloo, 2019-09-04)
      Measuring the expectation value of Pauli operators on prepared quantum states is a fundamental task in the variational quantum eigensolver. Simultaneously measuring sets of operators allows for fewer measurements and an ...
    • Passenger Response to Driving Style in an Autonomous Vehicle 

      Dillen, Nicole (University of Waterloo, 2019-09-23)
      Despite rapid advancements in automated driving systems (ADS), current human-computer interaction research tends to focus more on the safety driver in lower level vehicles. The future of automated driving lies in higher ...

      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