Now showing items 532-551 of 2993

    • Convolutional Neural Network for Sentence Classification 

      Chen, Yahui (University of Waterloo, 2015-08-26)
      The goal of a Knowledge Base–supported Question Answering (KB-supported QA) system is to answer a query natural language by obtaining the answer from a knowledge database, which stores knowledge in the form of (entity, ...
    • Coordination in a Peer Production Platform: A study of Reddit's /r/Place experiment 

      Armstrong, Ben (University of Waterloo, 2018-10-24)
      Understanding the factors causing groups to engage in coordinating behaviour has been an active research area for decades. In this thesis, we study this problem using a novel dataset of crowd behaviour from an online ...
    • COPIA: A New Software for Finding Consensus Patterns in Unaligned Protein Sequences 

      Liang, Chengzhi (University of Waterloo, 2001)
      Consensus pattern problem (CPP) aims at finding conserved regions, or motifs, in unaligned sequences. This problem is NP-hard under various scoring schemes. To solve this problem for protein sequences more efficiently,a ...
    • Cops and Robber Game with a Fast Robber 

      Mehrabian, Abbas (University of Waterloo, 2011-03-24)
      Graph searching problems are described as games played on graphs, between a set of searchers and a fugitive. Variants of the game restrict the abilities of the searchers and the fugitive and the corresponding search number ...
    • A copula model for marked point processes 

      Diao, Liqun; Cook, Richard J.; Lee, Ker-Ai (Springer, 2013)
      Many chronic diseases feature recurring clinically important events. In addition, however, there often exists a random variable which is realized upon the occurrence of each event reflecting the severity of the event, a ...
    • Copula Models for Multi-type Life History Processes 

      Diao, Liqun (University of Waterloo, 2013-08-30)
      This thesis considers statistical issues in the analysis of data in the studies of chronic diseases which involve modeling dependencies between life history processes using copula functions. Many disease processes feature ...
    • A Copula-based Quantile Risk Measure Approach to Hedging under Regime Switching 

      Hu , Xin (University of Waterloo, 2015-10-16)
      In this thesis, our work builds on the future hedging strategy presented by Barbi and Romagnoli (2014). The authors propose the optimal hedge ratio as the minimizer of a generic quantile risk measure (QRM), which includes ...
    • Core Structures in Random Graphs and Hypergraphs 

      Sato, Cristiane Maria (University of Waterloo, 2013-08-30)
      The k-core of a graph is its maximal subgraph with minimum degree at least k. The study of k-cores in random graphs was initiated by Bollobás in 1984 in connection to k-connected subgraphs of random graphs. Subsequently, ...
    • Correlated Data Analysis with Copula Models or Bayesian Nonparametric Methods 

      Zhuang, Haoxin (University of Waterloo, 2021-01-20)
      Different types of correlated data arise commonly in many studies and present considerable challenges in modeling and characterizing complex dependence structures. This thesis considers statistical issues in analyzing such ...
    • Correlation and Communication via a Quantum Field 

      Simidzija, Petar (University of Waterloo, 2019-07-15)
      We study the ability of qubit detectors to i) extract correlations from, and ii) transmit quantum information through, a quantum field. We start by perturbatively studying the harvesting of correlations from thermal and ...
    • Correspondence Colouring and its Applications to List Colouring and Delay Colouring 

      Saleh, Rana (University of Waterloo, 2021-09-28)
      In this thesis, we study correspondence colouring and its applications to list colouring and delay colouring. We give a detailed exposition of the paper of Dvořák, and Postle introducing correspondence colouring. Moreover, ...
    • A Cost Model for a Fingered Join Operator in Relational Query Plans 

      Prathish, Vishnu (University of Waterloo, 2015-08-12)
      We introduce the finger aware cursor operator for relational join queries. It scans a list of tuples in a finger enabled manner when a nested loop join operation is performed. Using this scan operation, we improve the ...
    • Cost-Effectiveness Evaluation Of Quadrivalent Influenza Vaccines For Seasonal Influenza Prevention: A Dynamic Modeling Study Of Canada And The United Kingdom 

      Thommes, Edward W.; Ismaila, Afisi; Chit, Ayman; Meier, Genevieve; Bauch, Chris T. (BioMed Central, 2015-10-27)
      Background: The adoption of quadrivalent influenza vaccine (QIV) to replace trivalent influenza vaccine (TIV) in immunization programs is growing worldwide, thus helping to address the problem of influenza B lineage mismatch. ...
    • Cost-Efficient Contingent Claims with Choquet Pricing 

      Zhu, Michael (University of Waterloo, 2020-09-30)
      We examine a problem, in which an investor seeks the cheapest contingent claim that achieves a minimum performance subject to a maximum allowed risk exposure. Specifically, our problem minimizes a non-linear cost functional, ...
    • Could The Human Papillomavirus Vaccines Drive Virulence Evolution? 

      Murall, Carmen Lia; Bauch, Chris T.; Day, Troy (Royal Society, The, 2015-01-07)
      The human papillomavirus (HPV) vaccines hold great promise for preventing several cancers caused by HPV infections. Yet little attention has been given to whether HPV could respond evolutionarily to the new selection ...
    • A Counterexample to a Conjecture About Triangle-Free Induced Subgraphs of Graphs with Large Chromatic Number 

      Carbonero, Alvaro; Hompe, Patrick; Moore, Benjamin; Spirkl, Sophie (Elsevier ScienceDirect, 2023-01)
      We prove that for every n, there is a graph G with χ(G) ≥ n and ω(G) ≤ 3 such that every induced subgraph H of G with ω(H) ≤ 2 satisfies χ(H) ≤ 4.This disproves a well-known conjecture. Our construction is a digraph with ...
    • Counting Bases 

      Webb, Kerri (University of Waterloo, 2004)
      A theorem of Edmonds characterizes when a pair of matroids has a common basis. Enumerating the common bases of a pair of matroid is a much harder problem, and includes the #P-complete problem of counting the number of ...
    • Counting Flimsy Numbers via Formal Language Theory 

      Clokie, Trevor (University of Waterloo, 2021-02-02)
      Let s_2(n) be the sum of the digits of n when expressed in base 2. For integers n and k, Stolarsky defined n to be k-flimsy if s_2(kn) < s_2(n). In this paper, we generalize the definition of k-flimsy numbers to all bases ...
    • Counting Pentagons in Triangle-free Binary Matroids 

      Brown, Adam (University of Waterloo, 2020-07-30)
      A rank-n binary matroid is a spanning subset E of F₂ⁿ\{0}, a triangle is a set of three elements from E which sum to zero, and the density of a rank-n binary matroid is |E|/2ⁿ. We begin by giving a new exposition of a ...
    • Counting points of bounded height on del Pezzo surfaces 

      Kleven, Stephanie (University of Waterloo, 2006)
      del Pezzo surfaces are isomorphic to either P<sup>1</sup> x P<sup>1</sup> or P<sup>2</sup> blown up <i>a</i> times, where <i>a</i> ranges from 0 to 8. We will look at lines on del Pezzo surfaces isomorphic to P<sup>2</sup> ...

      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