Now showing items 408-427 of 1544

    • Early Language Learning is a Good Model for Studying Early User Interface Learning 

      Lester, Erin (University of Waterloo, 2005)
      To date, the self-revealing interface has been the elusive holy grail of the user interface community. This research advocates the use of early language learning as a model for early user interface learning. This model ...
    • EdgeX: Edge Replication for Web Applications 

      Saxena, Hemant (University of Waterloo, 2015-10-13)
      Global web applications face the problem of high network latency due to their need to communicate with distant data centers. Many applications use edge networks for caching images, CSS, javascript, and other static content ...
    • Editing Fluid Flows with Divergence-Free Biharmonic Vector Field Interpolation 

      Ozdemir, Tumay (University of Waterloo, 2022-09-16)
      Achieving satisfying fluid animation through numerical simulation can be time-consuming because such simulations are computationally expensive to perform and there are few practical post-processing tools for editing of ...
    • Effcient Simulation of Message-Passing in Distributed-Memory Architectures 

      Demaine, Erik (University of Waterloo, 1996)
      In this thesis we propose a distributed-memory parallel-computer simulation system called PUPPET (Performance Under a Pseudo-Parallel EnvironmenT). It allows the evaluation of parallel programs run in a pseudo-parallel ...
    • Effect of Prevalence on Relevance Assessing Behaviour 

      Jethani, Chandra Prakash (University of Waterloo, 2011-08-29)
      Relevance assessing is an important part of information retrieval (IR) evaluation in addition to being something that all users of IR systems must do as part of their search for relevant documents. In this thesis, we present ...
    • Effective and Efficient Optimization Methods for Kernel Based Classification Problems 

      Tayal, Aditya (University of Waterloo, 2014-04-22)
      Kernel methods are a popular choice in solving a number of problems in statistical machine learning. In this thesis, we propose new methods for two important kernel based classification problems: 1) learning from highly ...
    • Effective Math-Aware Ad-Hoc Retrieval based on Structure Search and Semantic Similarities 

      Zhong, Wei (University of Waterloo, 2023-09-15)
      Despite the prevalence of digital scientific and educational contents on the Internet, only a few search engines are capable to retrieve them efficiently and effectively. The main challenge in freely searching scientific ...
    • Effective Use of SSDs in Database Systems 

      Ghodsnia, Pedram (University of Waterloo, 2018-05-07)
      With the advent of solid state drives (SSDs), the storage industry has experienced a revolutionary improvement in I/O performance. Compared to traditional hard disk drives (HDDs), SSDs benefit from shorter I/O latency, ...
    • Effects of Developmental Heuristics for Natural Language Learning 

      Engels, Steve (University of Waterloo, 2003)
      Machine learning in natural language has been a widely pursued area of research. However, few learning techniques model themselves after human learning, despite the nature of the task being closely connected to human ...
    • Effects of Personality Traits and Emotional Factors in Pull Request Acceptance. 

      Iyer, Rahul (University of Waterloo, 2019-08-26)
      Social interactions in the form of discussion are an indispensable part of collaborative software development. The discussions are essential for developers to share their views and to form a strong relationship with other ...
    • The Effects of Time Constraints and Document Excerpts on Relevance Assessing Behavior 

      Rahbariasl, Shahin (University of Waterloo, 2018-08-30)
      Assessors who judge the relevance of documents to the search topics and perform the relevance assessment process are one of the main parts of Information Retrieval (IR) sys- tems evaluations. They play a significant role ...
    • Efficient algorithms in quantum query complexity 

      Kothari, Robin (University of Waterloo, 2014-08-13)
      In this thesis we provide new upper and lower bounds on the quantum query complexity of a diverse set of problems. Specifically, we study quantum algorithms for Hamiltonian simulation, matrix multiplication, oracle ...
    • Efficient and Differentially Private Statistical Estimation via a Sum-of-Squares Exponential Mechanism 

      Majid, Mahbod (University of Waterloo, 2023-01-30)
      As machine learning is applied to more privacy-sensitive data, it is becoming increasingly crucial to develop algorithms that maintain privacy. However, even the most basic high-dimensional statistical estimation tasks ...
    • Efficient and Flexible Search in Large Scale Distributed Systems 

      Ahmed, Reaz (University of Waterloo, 2007-05-18)
      Peer-to-peer (P2P) technology has triggered a wide range of distributed systems beyond simple file-sharing. Distributed XML databases, distributed computing, server-less web publishing and networked resource/service ...
    • Efficient Computation with Sparse and Dense Polynomials 

      Roche, Daniel Steven (University of Waterloo, 2011-04-26)
      Computations with polynomials are at the heart of any computer algebra system and also have many applications in engineering, coding theory, and cryptography. Generally speaking, the low-level polynomial computations of ...
    • Efficient Data Structures for Partial Orders, Range Modes, and Graph Cuts 

      Sandlund, Bryce (University of Waterloo, 2021-04-30)
      This thesis considers the study of data structures from the perspective of the theoretician, with a focus on simplicity and practicality. We consider both the time complexity as well as space usage of proposed solutions. ...
    • Efficient Evaluation of Set Expressions 

      Mirzazadeh, Mehdi (University of Waterloo, 2014-04-17)
      In this thesis, we study the problem of evaluating set expressions over sorted sets in the comparison model. The problem arises in the context of evaluating search queries in text database systems; most text search engines ...
    • Efficient Geo-Distributed Transaction Processing 

      Hildred, Joshua Thomas (University of Waterloo, 2023-05-31)
      Distributed deterministic database systems support OLTP workloads over geo-replicated data. Providing these transactions with ACID guarantees requires a delay of multiple wide-area network (WAN) round trips of messaging ...
    • An Efficient Geometric Multigrid Solver for Viscous Liquids 

      Aanjaneya, Mridul; Han, Chengguizi; Goldade, Ryan; Batty, Christopher (ACM, 2019-07)
      We present an efficient geometric Multigrid solver for simulating viscous liquids based on the variational approach of Batty and Bridson [2008]. Although the governing equations for viscosity are elliptic, the strong ...
    • Efficient Implementation of Parametric Polymorphism using Reified Types 

      D'Souza, Matthew (University of Waterloo, 2023-04-28)
      Parametric polymorphism is a language feature that lets programmers define code that behaves independently of the types of values it operates on. Using parametric polymorphism enables code reuse and improves the maintainability ...


      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