Now showing items 2770-2789 of 3032

    • TCP Connection Management Mechanisms for Improving Internet Server Performance 

      Shukla, Amol (University of Waterloo, 2005)
      This thesis investigates TCP connection management mechanisms in order to understand the behaviour and improve the performance of Internet servers during overload conditions such as flash crowds. We study several ...
    • Techniques and heuristics for improving the visual design of software agreements 

      Kay, Matthew (University of Waterloo, 2010-09-10)
      End users must regularly agree to lengthy software agreements prior to installing software or using software services. However, despite the fact that these agreements contain terms of direct concern to users—e.g., data ...
    • Techniques for creating ground-truthed sketch corpora 

      MacLean, Scott (University of Waterloo, 2009-08-26)
      The problem of recognizing handwritten mathematics notation has been studied for over forty years with little practical success. The poor performance of math recognition systems is due, at least in part, to a lack of ...
    • Techniques for Proving Approximation Ratios in Scheduling 

      Ravi, Peruvemba Sundaram (University of Waterloo, 2010-09-30)
      The problem of finding a schedule with the lowest makespan in the class of all flowtime-optimal schedules for parallel identical machines is an NP-hard problem. Several approximation algorithms have been suggested for ...
    • Techniques for Quantum Computing 

      Kaye, Phillip (University of Waterloo, 2007-09-21)
      This thesis is about techniques for quantum computing. A common theme throughout this work is the examination of how quantum algorithms and protocols might be implemented in practice. I explore this question at the level ...
    • Techniques in operator algebras: classification, dilation and non-commutative boundary theory 

      Dor On, Adam (University of Waterloo, 2017-08-11)
      In this thesis we bring together several techniques in the theory of non-self-adjoint operator algebras and operator systems. We begin with classification of non-self-adjoint and self-adjoint operator algebras constructed ...
    • Techniques of Side Channel Cryptanalysis 

      Muir, James (University of Waterloo, 2001)
      The traditional model of cryptography examines the security of cryptographic primitives as mathematical functions. This approach does not account for the physical side effects of using these primitives in the real world. ...
    • Technological strategies to estimate and control diffusive passage times through the mucus barrier in mucosal drug delivery 

      Newby, Jay M.; Seim, Ian; Lysy, Martin; Ling, Yun; Huckaby, Justin; Lai, Samuel K.; Forest, M. Gregory (Elsevier, 2018-01-01)
      In mucosal drug delivery, two design goals are desirable: 1) insure drug passage through the mucosal barrier to the epithelium prior to drug removal from the respective organ via mucus clearance: and 2) design carrier ...
    • Technology Diffusion on Spiders 

      Sharma, Charupriya (University of Waterloo, 2017-08-29)
      There has been significant research about cascade effects that occur when information is spread through a network. Most models of such cascade effects are highly-localised, which means that they assume a node’s behaviour ...
    • Temporal Logic Model Checking as Automated Theorem Proving 

      Vakili, Amirhossein (University of Waterloo, 2016-01-19)
      Model checking is an automatic technique for the verification of temporal properties of a system. In this technique, a system is represented as a labelled graph and the specification as a temporal logic formula. The core ...
    • Tensors: Entanglement, Geometry, and Combinatorics 

      Lovitz, Benjamin (University of Waterloo, 2022-04-26)
      In this thesis, we use algebraic-geometric and combinatorial techniques to study tensor decompositions, with applications in quantum information theory, algebraic complexity theory, and algebraic statistics. A tensor is a ...
    • Territoriality and Behaviour On and Around Large Vertical Publicly-Shared Displays 

      Azad, Alec (University of Waterloo, 2012-06-07)
      Large displays and information kiosks are becoming increasingly common installations in public venues to provide an efficient self-serve means for patrons to access information and/or services. They have evolved over a ...
    • Tessellating Algebraic Curves and Surfaces Using A-Patches 

      Luk, Curtis (University of Waterloo, 2008-05-16)
      This work approaches the problem of triangulating algebraic curves/surfaces with a subdivision-style algorithm using A-Patches. An implicit algebraic curve is converted from the monomial basis to the bivariate Bernstein-Bezier ...
    • Test collections for web-scale datasets using Dynamic Sampling 

      Singh, Anmol (University of Waterloo, 2022-01-17)
      Dynamic Sampling is a non-uniform statistical sampling strategy based on S-CAL, a high-recall retrieval algorithm. It is used for the construction of statistical test collections for evaluating information retrieval ...
    • Test-Time Training for Image Inpainting 

      Ghiro, Genseric (University of Waterloo, 2022-06-21)
      Image inpainting is the task of filling missing regions in images with plausible and coherent content. The usual process involves training a CNN on a large collection of examples that it can learn from, to later apply this ...
    • Testing Submodularity 

      Bommireddi, Venkata Abhinav (University of Waterloo, 2017-09-28)
      We show that for any constants $\epsilon > 0$ and $p \ge 1$, given oracle access to an unknown function $f : \{0,1\}^n \to [0,1]$ it is possible to determine if the function is submodular or is $\epsilon$-far from every ...
    • Testing vertex connectivity of bowtie 1-plane graphs 

      Murali, Karthik (University of Waterloo, 2022-07-18)
      A separating set of a connected graph $G$ is a set of vertices $S$ such that $G-S$ is disconnected. $S$ is a minimum separating set of $G$ if there is no separating set of $G$ with fewer vertices than $S$. The size of a ...
    • Testing, Learning, Sampling, Sketching 

      Harms, Nathaniel (University of Waterloo, 2022-08-22)
      We study several problems about sublinear algorithms, presented in two parts. Part I: Property testing and learning. There are two main goals of research in property testing and learning theory. The first is to understand ...
    • Tetrahedral Embedded Boundary Methods for Accurate and Flexible Adaptive Fluids 

      Batty, Christopher; Xenos, Stefan; Houston, Ben (Wiley, 2010-05)
      When simulating fluids, tetrahedral methods provide flexibility and ease of adaptivity that Cartesian grids find difficult to match. However, this approach has so far been limited by two conflicting requirements. First, ...
    • Text Mining to Understand Gender Issues: Stories from The Red Pill, Men's Rights, and Feminism Movements 

      Khan, Abeer (University of Waterloo, 2019-08-28)
      Addressing gender issues has become important worldwide. The United Nations (UN) endorses big data projects as a valuable tool to monitor its gender-related development goals. In this thesis, we first motivate the examination ...

      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