Browsing Computer Science by Title
Now showing items 46-65 of 1551
-
Aggregation of Heterogeneous Anomaly Detectors for Cyber-Physical Systems
(University of Waterloo, 2019-01-07)Distributed, life-critical systems that bridge the gap between software and hardware are becoming an integral part of our everyday lives. From autonomous cars to smart electrical grids, such cyber-physical systems will ... -
Agile Architecture Recovery
(University of Waterloo, 2002)Many software development projects start with an existing code base that has to be tightly integrated into a new system. In order to make a robust system that will achieve the desired business goals, developers must be ... -
Aiding Human Discovery of Out-of-the-Moment Handwriting Recognition Errors
(University of Waterloo, 2009-04-30)Handwriting recognizers frequently misinterpret digital ink input, requiring human verification of recognizer output to identify and correct errors, before the output of the recognizer can be used with any confidence int ... -
ALDB: Debugging Alloy Models of Behavioural Requirements
(IEEE, 2020-08)Declarative modelling languages, such as Alloy, are becoming popular for describing behavioural requirements very early in system development because automated analysis of these models provides valuable feedback. Typically, ... -
Algorithmic Analysis of Infinite-State Systems
(University of Waterloo, 2009-02-10)Many important software systems, including communication protocols and concurrent and distributed algorithms generate infinite state-spaces. Model-checking which is the most prominent algorithmic technique for the verification ... -
Algorithms and Design Principles for Rural Kiosk Networks
(University of Waterloo, 2007-09-19)The KioskNet project aims to provide extremely low-cost Internet access to rural kiosks in developing countries, where conventional access technologies, \eg\, DSL, CDMA and dial-up, are currently economically infeasible. ... -
Algorithms for Characterizing Peptides and Glycopeptides with Mass Spectrometry
(University of Waterloo, 2013-09-26)The emergence of tandem mass spectrometry (MS/MS) technology has significantly accelerated protein identification and quantification in proteomics. It enables high-throughput analysis of proteins and their quantities in a ... -
Algorithms for Drinfeld Modules
(University of Waterloo, 2024-04-23)Drinfeld modules play an important role in number theory over function fields, analogizing that of elliptic curves for the number field setting. The broad success in translating results over from number fields to function ... -
Algorithms for fast linear system solving and rank profile computation
(University of Waterloo, 2014-07-16)We give randomized algorithms for linear algebra problems concerning an n*m input matrix A over a field K. We give an algorithm that simultaneously computes the row and column rank profiles of A in 2r^3 + (r^2+n+m+|A|)^{1+o(1)} ... -
Algorithms for Geometric Covering and Piercing Problems
(University of Waterloo, 2013-01-10)This thesis involves the study of a range of geometric covering and piercing problems, where the unifying thread is approximation using disks. While some of the problems addressed in this work are solved exactly with ... -
Algorithms for Geometric Facility Location: Centers in a Polygon and Dispersion on a Line
(University of Waterloo, 2023-02-24)We study three geometric facility location problems in this thesis. First, we consider the dispersion problem in one dimension. We are given an ordered list of (possibly overlapping) intervals on a line. We wish to choose ... -
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials
(University of Waterloo, 2021-08-17)Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences ... -
Algorithms for Normal Forms for Matrices of Polynomials and Ore Polynomials
(University of Waterloo, 2003)In this thesis we study algorithms for computing normal forms for matrices of Ore polynomials while controlling coefficient growth. By formulating row reduction as a linear algebra problem, we obtain a fraction-free ... -
Algorithms for Optimizing Search Schedules in a Polygon
(University of Waterloo, 2008-09-10)In the area of motion planning, considerable work has been done on guarding problems, where "guards", modelled as points, must guard a polygonal space from "intruders". Different variants of this problem involve varying ... -
Algorithms for the Optimization of Quantum Circuits
(University of Waterloo, 2013-08-30)This thesis investigates techniques for the automated optimization of quantum circuits. In the first part we develop an exponential time algorithm for synthesizing minimal depth quantum circuits. We combine this with ... -
Algorithms in Intersection Theory in the Plane
(University of Waterloo, 2023-06-02)This thesis presents an algorithm to find the local structure of intersections of plane curves. More precisely, we address the question of describing the scheme of the quotient ring of a bivariate zero-dimensional ideal ... -
Algorizmi: A Configurable Virtual Testbed to Generate Datasets for Offline Evaluation of Intrusion Detection Systems
(University of Waterloo, 2010-01-13)Intrusion detection systems (IDSes) are an important security measure that network administrators adopt to defend computer networks against malicious attacks and intrusions. The field of IDS research includes many challenges. ... -
All-or-Nothing Private Record Linkage over Streaming Data
(University of Waterloo, 2022-05-24)The prevalence and increasing need for insights obtained from the collection of sensitive data gives rise to the problem of protecting the privacy of this data. The collection and storage of data can be distributed across ... -
Almost synchronous correlations defined within tracial von Neumann algebras
(University of Waterloo, 2022-08-24)This thesis concerns a class of non-local games known as synchronous games. In recent work, it was discovered independently by [Vid22] and [PP22] that, for any synchronous games, any near-optimal finite dimensional ... -
AlphaStar: Considerations and Human-like Constraints for Deep Learning Game Interfaces
(University of Waterloo, 2020-12-15)Games have historically been a fruitful area for artificial intelligence (AI) research, and StarCraft in particular has been an important grand challenge because of its strategic complexity, multi-agent dynamics, partial ...