Browsing Computer Science by Title
Now showing items 780799 of 1567

Leveraging Watermarks to Improve Performance of Streaming Systems
(University of Waterloo, 20200528)Modern stream processing engines (SPEs) process large volumes of events propagated at high velocity through multiple queries. By continuously receiving watermarks, which are marker events injected into the stream to signify ... 
Lexical Affinities and Language Applications
(University of Waterloo, 2004)Understanding interactions among words is fundamental for natural language applications. However, many statistical NLP methods still ignore this important characteristic of language. For example, information retrieval ... 
LightPlay: An Ambient Light System for Video Game Indicators and Notifications
(University of Waterloo, 20200811)Video games often have indicators and notifications to convey ingame information. However, displaying these visuals onscreen come with tradeoffs, such as consuming screen real estate and an inability for them to be ... 
Likelihoodbased Density Estimation using Deep Architectures
(University of Waterloo, 20191220)Multivariate density estimation is a central problem in unsupervised machine learning that has been studied immensely in both statistics and machine learning. Several methods have thus been proposed for density estimation ... 
The Limited Effectiveness of Neural Networks for Simple Question Answering on Knowledge Graphs
(University of Waterloo, 20171208)Simple factoid question answering (QA) is a task, where the questions can be answered by looking up a single fact in the knowledge base (KB). However, this QA task is difficult, since retrieving a single supporting fact ... 
Linear and Nonlinear Monotone Methods for Valuing Financial Options Under TwoFactor, JumpDiffusion Models
(University of Waterloo, 20071001)The evolution of the price of two financial assets may be modeled by correlated geometric Brownian motion with additional, independent, finite activity jumps. Similarly, the evolution of the price of one financial asset ... 
Linear Approximations For Factored Markov Decision Processes
(University of Waterloo, 2004)A Markov Decision Process (MDP) is a model employed to describe problems in which a decision must be made at each one of several stages, while receiving feedback from the environment. This type of model has been extensively ... 
Linearizing Contextual MultiArmed Bandit Problems with Latent Dynamics
(University of Waterloo, 20220210)In many realworld applications of multiarmed bandit problems, both rewards and observed contexts are often influenced by confounding latent variables which evolve stochastically over time. While the observed contexts and ... 
Linking Alloy with SMTbased Finite Model Finding
(University of Waterloo, 20210128)Alloy is a wellknown declarative language for modelling systems early in the development process. Currently, it uses the Kodkod library as its backend for finite model finding (finding instances of the model by determining ... 
List Coloring Some Classes of 1Planar Graphs
(University of Waterloo, 20211223)In list coloring we are given a graph G and a list assignment for G which assigns to each vertex of G a list of possible colors. We wish to find a coloring of the vertices of G such that each vertex uses a color from its ... 
Live API Documentation
(University of Waterloo, 20140723)Application Programming Interfaces (APIs) provide powerful abstraction mechanisms that enable complex functionality to be used by client programs. However, this abstraction does not come for free: understanding how to use ... 
Local and Cooperative Autonomous Vehicle Perception from Synthetic Datasets
(University of Waterloo, 20190923)The purpose of this work is to increase the performance of autonomous vehicle 3D object detection using synthetic data. This work introduces the Precise Synthetic Image and LiDAR (PreSIL) dataset for autonomous vehicle ... 
Local Graph Clustering Using l1regularized PageRank Algorithms
(University of Waterloo, 20200505)Local graph clustering methods are used to find small and mediumscale clusters without traversing the graph. It has been shown that the combination of Approximate Personalized PageRank (APPR) algorithm and sweep method ... 
Local Reasoning for Parameterized First Order Protocols
(University of Waterloo, 20190814)First Order Logic (FOL) is a powerful reasoning tool for program verification. Recent work on Ivy shows that FOL is well suited for verification of parameterized distributed systems. However, specifying many natural objects, ... 
Longterm Average Cost in Featured Transition Systems
(ACM, 201609)A software product line is a family of software products that share a common set of mandatory features and whose individual products are differentiated by their variable (optional or alternative) features. Familybased ... 
Longer Delays in Rehearsalbased Interfaces Increase Expert Use
(University of Waterloo, 20190808)Rehearsalbased interfaces are designed to encourage a transition from novice to expert, but many users fail to make this transition. Most of these interfaces activate novice mode after a short delay, between 150 and 500ms. ... 
Loop Modeling in Proteins Using a Database Approach with MultiDimensional Scaling
(University of Waterloo, 20130926)Modeling loops is an often necessary step in protein structure and function determination, even with experimental Xray and NMR data. It is well known to be difficult. Database techniques have the advantage of producing ... 
LOWRESOLUTION CUSTOMIZABLE UBIQUITOUS DISPLAYS
(University of Waterloo, 20230922)In a conventional display, pixels are constrained within the rectangular or circular boundaries of the device. This thesis explores moving pixels from a screen into the surrounding environment to form ubiquitous displays. ... 
Lower Bounds and Derandomization
(University of Waterloo, 20080826)A major open problem in complexity theory is to determine whether randomized complexity classes such as BPP, AM, and MA have any nontrivial derandomization. This thesis investigates the derandomization of two randomized ... 
Lower Bounds on Quantum Query and Learning Graph Complexities
(University of Waterloo, 20140722)In this thesis we study the power of quantum query algorithms and learning graphs; the latter essentially being very specialized quantum query algorithms themselves. We almost exclusively focus on proving lower bounds for ...