## Search

Now showing items 1-10 of 56

#### Adapting Component Analysis

(University of Waterloo, 2012-05-18)

A main problem in machine learning is to predict the response variables of a test set given the training data and its corresponding response variables. A predictive model can perform satisfactorily only if the training ...

#### Planar Open Rectangle-of-Influence Drawings

(University of Waterloo, 2012-05-18)

A straight line drawing of a graph is an open weak rectangle-of-influence
(RI) drawing, if there is no vertex in the relative interior of the axis
parallel rectangle induced by the end points of each edge.
Despite recent ...

#### 2-crossing critical graphs with a V8 minor

(University of Waterloo, 2012-01-17)

The crossing number of a graph is the minimum number of pairwise crossings of edges among all planar drawings of the graph. A graph G is k-crossing critical if it has crossing number k and any proper subgraph of G has a ...

#### Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux

(University of Waterloo, 2012-09-28)

Cyclic sieving phenomenon (CSP) is a generalization by Reiner, Stanton, White of Stembridge's q=-1 phenomenon. When CSP is exhibited, orbits of a cyclic action on combinatorial objects show a nice structure and their sizes ...

#### Generalisations of Roth's theorem on finite abelian groups

(University of Waterloo, 2012-12-18)

Roth's theorem, proved by Roth in 1953, states that when A is a subset of the integers [1,N] with A dense enough, A has a three term arithmetic progression (3-AP). Since then the bound originally given by Roth has been ...

#### Predicting Test Suite Effectiveness for Java Programs

(University of Waterloo, 2012-07-26)

The coverage of a test suite is often used as a proxy for its effectiveness. However, previous studies that investigated the influence of code coverage on test suite effectiveness have failed to reach a consensus about ...

#### Computing Popov Forms of Polynomial Matrices

(University of Waterloo, 2012-01-19)

This thesis gives a deterministic algorithm to transform a row reduced matrix to canon-
ical Popov form. Given as input a row reduced matrix R over K[x], K a ﬁeld, our algorithm
computes the Popov form in about the same ...

#### Evolution and Architecture of Open Source Software Collections: A Case Study of Debian

(University of Waterloo, 2012-08-29)

Software has been studied at a variety of granularities. Code, classes, groups of classes, programs and finally large scale applications have been examined in detail. What lies beyond is the study of software collections ...

#### Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability

(University of Waterloo, 2012-08-30)

Boolean Satisfiability (SAT) is a fundamental NP-complete problem of determining whether there exists an assignment of variables which
makes a Boolean formula evaluate to True. SAT is a convenient representation for many ...

#### The two-space homogenization method

(University of Waterloo, 2012-10-04)

In this thesis, we consider the two-space homogenization method, which produces macroscopic expressions out of descriptions of the behaviour of the microstructure. Specifically, we focus on its application to poroelastic ...