Browsing Computer Science by Title
Now showing items 86-105 of 1568
-
Ape+: A Faster Ape with Static Model Guided Exploration
(University of Waterloo, 2022-08-17)Ape is the state-of-the-art Android GUI testing tool, which implements a dynamic model internally to guide the testing process. At the time of writing, Ape was one of the most effective Android testing tools. Ape’s ... -
API Parameter Recommendation Based on Documentation Analysis
(University of Waterloo, 2020-01-20)Application Programming Interfaces (APIs) are widely used in today's software development, as they provide a easy and safe way to build more powerful applications with less code. However, learning how to use an API function ... -
Appearance Changes due to Light Exposure
(University of Waterloo, 2017-01-12)The fading of materials due to light exposure over time is a major contributor to the overall aged appearance of man-made objects. Although much attention has been devoted to the modeling of aging and weathering phenomena ... -
Application of Definability to Query Answering over Knowledge Bases
(University of Waterloo, 2014-01-22)Answering object queries (i.e. instance retrieval) is a central task in ontology based data access (OBDA). Performing this task involves reasoning with respect to a knowledge base K (i.e. ontology) over some description ... -
An Application of Out-of-Distribution Detection for Two-Stage Object Detection Networks
(University of Waterloo, 2020-02-14)Recently, much research has been published for detecting when a classification neural network is presented with data that does not fit into one of the class labels the network learned at train time. These so-called ... -
The application of the in-tree knapsack problem to routing prefix caches
(University of Waterloo, 2009-04-30)Modern routers use specialized hardware, such as Ternary Content Addressable Memory (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact that TCAM is a non-standard type of memory and ... -
Applications of Artificial Intelligence to the NHL Entry Draft
(University of Waterloo, 2019-01-31)This thesis investigates the application of various fields of artificial intelligence to the domain of sports management and analysis. The research in this thesis is primarily focussed on the entry draft for the National ... -
Applications of Description Logic and Causality in Model Checking
(University of Waterloo, 2009-06-19)Model checking is an automated technique for the verification of finite-state systems that is widely used in practice. In model checking, a model M is verified against a specification $\varphi$, exhaustively checking ... -
Applying Fair Reward Divisions to Collaborative Work
(University of Waterloo, 2019-07-18)Collaborative crowdsourcing tasks allow workers to solve more difficult problems than they could alone, but motivating workers in these tasks is complex. In this thesis, we study how to use payments to motivate groups of ... -
Approach to Evaluating Clustering Using Classification Labelled Data
(University of Waterloo, 2011-01-17)Cluster analysis has been identified as a core task in data mining for which many different algorithms have been proposed. The diversity, on one hand, provides us a wide collection of tools. On the other hand, the profusion ... -
Approaches and Techniques to Enhance Efficiency and Performance of Non-Contrastive Self-Supervised Learning Methods
(University of Waterloo, 2023-03-31)Self-supervised learning (SSL) methods have gained considerable attention in recent years due to their ability to learn useful representations of data without relying on labels during training. These methods have ... -
Approximately Optimum Search Trees in External Memory Models
(University of Waterloo, 2016-05-16)We examine optimal and near optimal solutions to the classic binary search tree problem of Knuth. We are given a set of n keys (originally known as words), B_1, B_2, ..., B_n and 2n+1 frequencies. {p_1, p_2, ..., p_n} ... -
An Approximation Algorithm for Character Compatibility and Fast Quartet-based Phylogenetic Tree Comparison
(University of Waterloo, 2000)Phylogenetic analysis, or the inference of evolutionary history is done routinely by biologists and is one of the most important problems in systematic biology. In this thesis, we study two computational problems in ... -
Approximation Algorithms for Geometric Covering Problems for Disks and Squares
(University of Waterloo, 2013-08-15)Geometric covering is a well-studied topic in computational geometry. We study three covering problems: Disjoint Unit-Disk Cover, Depth-(≤ K) Packing and Red-Blue Unit-Square Cover. In the Disjoint Unit-Disk Cover ... -
Approximation Algorithms for Rectangle Piercing Problems
(University of Waterloo, 2005)Piercing problems arise often in facility location, which is a well-studied area of computational geometry. The general form of the piercing problem discussed in this dissertation asks for the minimum number of facilities ... -
Approximation, Proof Systems, and Correlations in a Quantum World
(University of Waterloo, 2012-08-29)This thesis studies three topics in quantum computation and information: The approximability of quantum problems, quantum proof systems, and non-classical correlations in quantum systems. Our first area of study concerns ... -
An Architecture for Geographically-Oriented Service Discovery on the Internet
(University of Waterloo, 2002)Most of the service discovery protocols available on the Internet are built upon its logical structure. This phenomenon can be observed frequently from the way in which they behave. For instance, Jini and SLP service ... -
An Architecture For Multi-Agent Systems Operating In Soft Real-Time Environments With Unexpected Events
(University of Waterloo, 2004)In this thesis, we explore the topic of designing an architecture and processing algorithms for a multi-agent system, where agents need to address potential unexpected events in the environment, operating under soft ... -
Are machine learning corpora “fair dealing” under Canadian law?
(Proceedings of the 12th International Conference on Computational Creativity, 2021-09)We consider the use of large corpora for training compuationally creative systems, particularly those that write new text based on the style of an existing author or genre. Under Canadian copyright law, a key concern for ... -
Area-Efficient Drawings of Outer-1-Planar Graphs
(University of Waterloo, 2020-09-29)We study area-efficient drawings of planar graphs: embeddings of graphs on an integer grid so that the bounding box of the drawing is minimized. Our focus is on the class of outer-1-planar graphs: the family of planar ...