## Search

Now showing items 11-20 of 180

#### The Erdős Pentagon Problem

(University of Waterloo, 2018-12-20)

The Erdős pentagon problem asks about the maximum number of copies of C_5 that one can find in a triangle-free graph. This problem was posed in 1984, but was not resolved until 2012. In this thesis, we aim to capture the ...

#### Learning Sparse Orthogonal Wavelet Filters

(University of Waterloo, 2018-10-12)

The wavelet transform is a well studied and understood analysis technique used in signal processing. In wavelet analysis, signals are represented by a sum of self-similar wavelet and scaling functions. Typically, the wavelet ...

#### An Experimental Analysis of Multi-Perspective Convolutional Neural Networks

(University of Waterloo, 2018-05-16)

Modelling the similarity of sentence pairs is an important problem in natural language processing and information retrieval, with applications in tasks such as paraphrase identification and answer selection in question ...

#### The Capacitated Matroid Median Problem

(University of Waterloo, 2018-05-18)

In this thesis, we study the capacitated generalization of the Matroid Median Problem which is a generalization of the classical clustering problem called the k-Median problem. In the capacitated matroid median problem, ...

#### Exploring Practical Methodologies for the Characterization and Control of Small Quantum Systems

(University of Waterloo, 2018-09-04)

We explore methodologies for characterizing and controlling small quantum systems. We are interested in starting with a description of a quantum system, designing estimators for parameters of the system, developing robust ...

#### Enhanced Multi-Touch Gestures for Complex Tasks

(University of Waterloo, 2018-12-21)

Recent technological advances have resulted in a major shift, from high-performance notebook and desktop computers -- devices that rely on keyboard and mouse for input -- towards smaller, personal devices like smartphones, ...

#### The Complexity of Network Design for s-t Eff ective Resistance

(University of Waterloo, 2018-08-23)

We consider a new problem of designing a network with small $s$-$t$ effective resistance.
In this problem, we are given an undirected graph $G=(V,E)$ where each edge $e$ has a cost $c_e$ and a resistance $r_e$, two ...

#### Privately Constrained Testable Pseudorandom Functions

(University of Waterloo, 2018-09-20)

Privately Constrained Pseudorandom Functions allow a PRF key to be delegated to some
evaluator in a constrained manner, such that the key’s functionality is restricted with
respect to some secret predicate. Variants of ...

#### Linearized Stability of Partial Differential Equations with Application to Stabilization of the Kuramoto--Sivashinsky Equation

(Society for Industrial and Applied Mathematics, 2018-01-05)

Linearization is a useful tool for analyzing the stability of nonlinear differential equations. Unfortunately, the proof of the validity of this approach for ordinary differential equations does not generalize to all ...

#### Ideal Clutters

(University of Waterloo, 2018-04-24)

Let E be a finite set of elements, and let C be a family of subsets of E called members. We say that C is a clutter over ground set E if no member is contained in another. The clutter C is ideal if every extreme point of ...