Now showing items 2738-2757 of 2985

    • 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 ...
    • Themelio: a new blockchain paradigm 

      Dong, Yuhao (University of Waterloo, 2023-10-10)
      Public blockchains hold great promise in building protocols that uphold security properties like transparency and consistency based on internal, incentivized cryptoeconomic mechanisms rather than preexisting trust in ...
    • Theoretical Description of the Forces on a Point Charge Moving Parallel to a Supported Two-dimensional Material 

      Preciado Rivas, María Rosa (University of Waterloo, 2022-09-22)
      A charged particle, moving at a certain distance and parallel to a target, experiences a stopping force that slows it down and an image force that deflects it towards the target's surface. In this work, we aimed to describe ...
    • Theoretical foundations for efficient clustering 

      Kushagra, Shrinu (University of Waterloo, 2019-06-07)
      Clustering aims to group together data instances which are similar while simultaneously separating the dissimilar instances. The task of clustering is challenging due to many factors. The most well-studied is the high ...
    • A Theoretical Study of Clusterability and Clustering Quality 

      Ackerman, Margareta (University of Waterloo, 2008-01-16)
      Clustering is a widely used technique, with applications ranging from data mining, bioinformatics and image analysis to marketing, psychology, and city planning. Despite the practical importance of clustering, there is ...
    • The Theory and Applications of Homomorphic Cryptography 

      Henry, Kevin John (University of Waterloo, 2008-08-27)
      Homomorphic cryptography provides a third party with the ability to perform simple computations on encrypted data without revealing any information about the data itself. Typically, a third party can calculate one of the ...
    • Theory and Mitigation of Crosstalk on Quantum Information Processors 

      Winick, Adam (University of Waterloo, 2023-09-08)
      Successfully implementing large-scale quantum computation has proven to be an exceptionally arduous task. Decoherence and imperfect control limit the coherent manipulation of large ensembles of particles. While quantum ...
    • Theory Of Atomata 

      Brzozowski, Janusz; Tamm, Hellis (Elsevier, 2014-06-19)
      We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "atomaton", whose states are the "atoms" of the language, that is, non-empty intersections of complemented or ...
    • Theory of measurement-based quantum computing 

      de Beaudrap, Jonathan Robert Niel (University of Waterloo, 2008-12-10)
      In the study of quantum computation, data is represented in terms of linear operators which form a generalized model of probability, and computations are most commonly described as products of unitary transformations, which ...
    • Thin Trees in Some Families of Graphs 

      Mousavi Haji, Seyyed Ramin (University of Waterloo, 2018-04-25)
      Let 𝐺=(𝑉,𝐸) be a graph and let 𝑇 be a spanning tree of 𝐺. The thinness parameter of 𝑇 denoted by 𝜌(𝑇) is the maximum over all cuts of the proportion of the edges of 𝑇 in the cut. Thin trees play an important role ...
    • Thomassen’s 5-Choosability Theorem Extends to Many Faces 

      Nevin, Joshua (University of Waterloo, 2021-09-10)
      We prove in this thesis that planar graphs can be L-colored, where L is a list-assignment in which every vertex has a 5-list except for a collection of arbitrarily large faces which have 3-lists, as long as those faces ...
    • Three Approaches to Building Time-Windowed Geometric Data Structures 

      Pratt, Simon (University of Waterloo, 2016-08-18)
      Given a set of geometric objects (points or line segments) each associated with a time value, we wish to determine whether a given property is true for a subset of those objects whose time values fall within a query time ...

      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