Now showing items 1386-1405 of 1545

    • 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 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 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 ...
    • 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 ...
    • Time-consistent mean–variance portfolio optimization: A numerical impulse control approach 

      Van Staden, Pieter M.; Dang, Duy-Minh; Forsyth, Peter A. (Elsevier, 2018-11-01)
      We investigate the time-consistent mean–variance (MV) portfolio optimization problem, popular in investment–reinsurance and investment-only applications, under a realistic context that involves the simultaneous application ...
    • A TMT-labeled Spectral Library for Peptide Sequencing 

      Shen, Jianqiao (University of Waterloo, 2017-12-07)
      Tandem mass spectrometry (MS/MS) is widely used nowadays for bioinformaticians to identify peptides and proteins. Three major peptide identification approaches and tools have been developed over the past two decades: ...
    • Topic-Oriented Collaborative Web Crawling 

      Chung, Chiasen (University of Waterloo, 2001)
      A <i>web crawler</i> is a program that "walks" the Web to gather web resources. In order to scale to the ever-increasing Web, multiple crawling agents may be deployed in a distributed fashion to retrieve web data ...
    • Topical Opinion Retrieval 

      Skomorowski, Jason (University of Waterloo, 2007-01-18)
      With a growing amount of subjective content distributed across the Web, there is a need for a domain-independent information retrieval system that would support ad hoc retrieval of documents expressing opinions on a specific ...
    • Topology-Awareness and Re-optimization Mechanism for Virtual Network Embedding 

      Butt, Nabeel (University of Waterloo, 2010-01-15)
      Embedding of virtual network (VN) requests on top of a shared physical network poses an intriguing combination of theoretical and practical challenges. Two major problems with the state-of-the-art VN embedding algorithms ...
    • Total Relation Recall: High-Recall Relation Extraction 

      Liu, Xinyu (University of Waterloo, 2021-04-28)
      As Knowledge Graphs (KGs) become important in a wide range of applications, including question-answering and recommender systems, more and more enterprises have recognized the value of constructing KGs with their own data. ...
    • Touch Crossing-Based Selection and the Pin-and-Cross Technique 

      Luo, Yuexing (University of Waterloo, 2015-05-13)
      This thesis focuses on the evaluation, exploration and demonstration of crossing paradigm with touch modality. Under the scenario of crossing selection, the target is selected by stroking through a boundary 'goal' instead ...

      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