Browsing Mathematics (Faculty of) by Title
Now showing items 61-80 of 3034
-
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, ... -
Algebraic Analysis of Vertex-Distinguishing Edge-Colorings
(University of Waterloo, 2006)Vertex-distinguishing edge-colorings (vdec colorings) are a restriction of proper edge-colorings. These special colorings require that the sets of edge colors incident to every vertex be distinct. This is a relatively ... -
Algebraic and combinatorial aspects of incidence groups and linear system non-local games arising from graphs
(University of Waterloo, 2019-06-06)To every linear binary-constraint system (LinBCS) non-local game, there is an associated algebraic object called the solution group. Cleve, Liu, and Slofstra showed that a LinBCS game has a perfect quantum strategy if and ... -
Algebraic Approaches to State Complexity of Regular Operations
(University of Waterloo, 2019-10-15)The state complexity of operations on regular languages is an active area of research in theoretical computer science. Through connections with algebra, particularly the theory of semigroups and monoids, many problems ... -
Algebraic Aspects of Multi-Particle Quantum Walks
(University of Waterloo, 2012-12-04)A continuous time quantum walk consists of a particle moving among the vertices of a graph G. Its movement is governed by the structure of the graph. More formally, the adjacency matrix A is the Hamiltonian that determines ... -
Algebraic characterization of multivariable dynamics
(University of Waterloo, 2009-03-26)Let X be a locally compact Hausdorff space along with n proper continuous maps σ = (σ1 , · · · , σn ). Then the pair (X, σ) is called a dynamical system. To each system one can associate a universal operator algebra called ... -
ALGEBRAIC DEGREE IN SPATIAL MATRICIAL NUMERICAL RANGES OF LINEAR OPERATORS
(American Mathematical Society, 2021-07-20)We study the maximal algebraic degree of principal ortho-compressions of linear operators that constitute spatial matricial numerical ranges of higher order. We demonstrate (amongst other things) that for a (possibly ... -
The Algebraic Kirchberg--Phillips Conjecture for Leavitt Path Algebras
(University of Waterloo, 2015-09-18)This essay is meant to be an exposition of the theory of Leavitt path algebras and graph C*-algebras, with an aim to discuss some current classification questions. These two classes of algebras sit on opposite sides of a ... -
Algebraic Methods and Monotone Hurwitz Numbers
(University of Waterloo, 2012-09-21)We develop algebraic methods to solve join-cut equations, which are partial differential equations that arise in the study of permutation factorizations. Using these techniques, we give a detailed study of the recently ... -
Algebraic Methods for Reducibility in Nowhere-Zero Flows
(University of Waterloo, 2007-09-25)We study reducibility for nowhere-zero flows. A reducibility proof typically consists of showing that some induced subgraphs cannot appear in a minimum counter-example to some conjecture. We derive algebraic proofs of ... -
Algebraic Multigrid for Markov Chains and Tensor Decomposition
(University of Waterloo, 2013-01-23)The majority of this thesis is concerned with the development of efficient and robust numerical methods based on adaptive algebraic multigrid to compute the stationary distribution of Markov chains. It is shown that classical ... -
Algebraic Tori in Cryptography
(University of Waterloo, 2005)Communicating bits over a network is expensive. Therefore, cryptosystems that transmit as little data as possible are valuable. This thesis studies several cryptosystems that require significantly less bandwidth than ... -
Algorithm Design for Ordinal Settings
(University of Waterloo, 2022-08-29)Social choice theory is concerned with aggregating the preferences of agents into a single outcome. While it is natural to assume that agents have cardinal utilities, in many contexts, we can only assume access to the ... -
An Algorithm for Stable Matching with Approximation up to the Integrality Gap
(University of Waterloo, 2020-07-10)In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B represent disjoint groups of agents, each of whom has ordinal preferences over the members of the opposite group. The goal is to ... -
Algorithm Substitution Attacks: Detecting ASAs Using State Reset and Making ASAs Asymmetric
(University of Waterloo, 2021-08-27)The field of cryptography has made incredible progress in the last several decades. With the formalization of security goals and the methods of provable security, we have achieved many privacy and integrity guarantees in ... -
Algorithmic Analysis of a General Class of Discrete-based Insurance Risk Models
(University of Waterloo, 2013-08-28)The aim of this thesis is to develop algorithmic methods for computing particular performance measures of interest for a general class of discrete-based insurance risk models. We build upon and generalize the insurance ... -
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 ... -
Algorithmic and Linear Programming-Based Techniques for the Maximum Utility Problem
(University of Waterloo, 2023-05-25)A common topic of study in the subfield of Operations Research known as Revenue Management is finding optimal prices for a line of products given customer preferences. While there exists a large number of ways to model ... -
Algorithmic Behaviours of Adagrad in Underdetermined Linear Regression
(University of Waterloo, 2023-08-24)With the high use of over-parameterized data in deep learning, the choice of optimizer in training plays a big role in a model’s ability to generalize well due to the existence of solution selection bias. We consider the ...