Now showing items 472-491 of 2985

    • Concatenating Bipartite Graphs 

      Chudnovsky, Maria; Hompe, Patrick; Scott, Alex; Seymour, Paul; Spirkl, Sophie (The Electronic Journal of Combinatorics, 2022)
      Let x, y E (0, 1], and let A, B, C be disjoint nonempty stable subsets of a graph G, where every vertex in A has at least x |B| neighbors in B, and every vertex in B has at least y|C| neighbors in C, and there are no edges ...
    • Concentration Bounds from Parallel Repetition Theorems 

      Hornby, Taylor (University of Waterloo, 2018-08-22)
      This thesis contributes to the study of parallel repetition theorems and concentration bounds for nonlocal games and quantum interactive proofs. We make the following contributions: - A lemma that is useful for converting ...
    • A conceptual IoT-based early-warning architecture for remote monitoring of COVID-19 patients in wards and at home 

      Paganelli, Antonio Iyda; Velmovitsky, Pedro Elkind; Miranda, Pedro; Branco, Adriano; Alencar, Paulo; Cowan, Donald; Endler, Markus; Morita, Plinio Pelegrini (Elsevier, 2022-05)
      Due to the COVID-19 pandemic, health services around the globe are struggling. An effective system for monitoring patients can improve healthcare delivery by avoiding in-person contacts, enabling early-detection of severe ...
    • Concurrency in C∀ 

      Delisle, Thierry (University of Waterloo, 2018-01-18)
      C∀ is a modern, non-object-oriented extension of the C programming language. This thesis serves as a definition and an implementation for the concurrency and parallelism C∀ offers. These features are created from scratch ...
    • Concurrent Data Structures Using Multiword Compare and Swap 

      Sigouin, William (University of Waterloo, 2020-05-04)
      To maximize the performance of concurrent data structures, researchers have turned to highly complex fine-grained techniques. Resulting algorithms are often extremely difficult to understand and prove correct, allowing for ...
    • Concurrent High-performance Persistent Hash Table In Java 

      Sun, Xianda (University of Waterloo, 2015-11-24)
      Current trading systems must handle both high volumes of trading and large amounts of trading data. One crucial module in high-performance trading is fast storage and retrieval of large volumes of data simultaneously ...
    • A Concurrent IFDS Dataflow Analysis Algorithm Using Actors 

      Rodriguez, Jonathan David (University of Waterloo, 2010-06-28)
      There has recently been a resurgence in interest in techniques for effective programming of multi-core computers. Most programmers find general-purpose concurrent programming to be extremely difficult. This difficulty ...
    • Concurrent Implementation of Packet Processing Algorithms on Network Processors 

      Groves, Mark (University of Waterloo, 2006)
      Network Processor Units (NPUs) are a compromise between software-based and hardwired packet processing solutions. While slower than hardwired solutions, NPUs have the flexibility of software-based solutions, allowing ...
    • Conditional Scenario Generation with a GVAR Model 

      Wang, Xinghao (University of Waterloo, 2016-12-15)
      The stress-testing method formed an integral part of the practice of risk management. However, the underlying models for scenarios generation have not been much studied so far. In past practice, the users typically did ...
    • Conformational Ensemble Generation via Constraint-based Rigid-body Dynamics Guided by the Elastic Network Model 

      Borowski, Krzysztof (University of Waterloo, 2011-08-29)
      Conformational selection is the idea that proteins traverse positions on the conformational space represented by their potential energy landscape, and in particular positions considered as local energy minima. Conformational ...
    • Connectivity Properties of the Flip Graph After Forbidding Triangulation Edges 

      Bigdeli, Reza (University of Waterloo, 2022-09-23)
      The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is ...
    • Connectivity, tree-decompositions and unavoidable-minors 

      Joeris, Benson (University of Waterloo, 2015-05-06)
      The results in this thesis are steps toward bridging the gap between the handful of exact structure theorems known for minor-closed classes of graphs, and the very general, yet wildly qualitative, Graph Minors Structure ...
    • Consensus Fold Recognition by Predicted Model Quality 

      Yu, Libo (University of Waterloo, 2005)
      Protein structure prediction has been a fundamental challenge in the biological field. In this post-genomic era, the need for automated protein structure prediction has never been more evident and researchers are now ...
    • Consensus Problems in Hybrid Multi-Agent Systems 

      Donganont, Mana (University of Waterloo, 2022-09-28)
      A multi-agent system (MAS) is a dynamic system that consists of a group of interacting agents distributed over a network. In the past decades, the study of distributed coordination of multi-agent systems has been widely ...
    • Consolidation and wave propagation in a porous medium 

      Gerasik, Vladimir (University of Waterloo, 2006)
      Basic diffusion analytical solutions of one-dimensional consolidation are presented for the case of a semi-infinite domain. Typical tractions considered include instantaneous loads of the medium with a free boundary ...
    • Constrained Nonnegative Matrix Factorization with Applications to Music Transcription 

      Recoskie, Daniel (University of Waterloo, 2014-08-15)
      In this work we explore using nonnegative matrix factorization (NMF) for music transcription, as well as several other applications. NMF is an unsupervised learning method capable of finding a parts-based additive model ...
    • Constrained Shortest Paths in Terrains and Graphs 

      Ahmed, Mustaq (University of Waterloo, 2009-10-28)
      Finding a shortest path is one of the most well-studied optimization problems. In this thesis we focus on shortest paths in geometric and graph theoretic settings subject to different feasibility constraints that arise in ...
    • Constrained-CNN losses for weakly supervised segmentation 

      Kervadec, Hoel; Dolz, Jose; Tang, Meng; Granger, Eric; Boykov, Yuri; Ben Ayed, Ismail (Elsevier, 2019-05)
      Weakly-supervised learning based on, e.g., partially labelled images or image-tags, is currently attracting significant attention in CNN segmentation as it can mitigate the need for full and laborious pixel/voxel annotations. ...
    • Constraint bubbles and affine regions: reduced fluid models for efficient immersed bubbles and flexible spatial coarsening 

      Goldade, Ryan; Aanjaneya, Mridul; Batty, Christopher (Association for Computing Machinery, 2020-07)
      We propose to enhance the capability of standard free-surface flow simulators with efficient support for immersed bubbles through two new models: constraint-based bubbles and affine fluid regions. Unlike its predecessors, ...
    • Constraint Programming Techniques for Optimal Instruction Scheduling 

      Malik, Abid (University of Waterloo, 2008-04-21)
      Modern processors have multiple pipelined functional units and can issue more than one instruction per clock cycle. This puts great pressure on the instruction scheduling phase in a compiler to expose maximum instruction ...

      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