## Search

Now showing items 1-10 of 44

#### Workload Matters: A Robust Approach to Physical RDF Database Design

(University of Waterloo, 2015-10-01)

Recent advances in Information Extraction, Linked Data Management and the Semantic Web have led to a rapid increase in both the volume and the variety of publicly available graph-structured data. As more and more businesses ...

#### On primal-dual interior-point algorithms for convex optimisation

(2015-09-29)

This thesis studies the theory and implementation of interior-point methods
for convex optimisation. A number of important problems from mathematics and
engineering can be cast naturally as convex optimisation ...

#### Generalized Set and Graph Packing Problems

(University of Waterloo, 2015-11-12)

Many complex systems that exist in nature and society can be expressed in terms of networks (e.g.,
social networks, communication networks, biological networks, Web graph, among others). Usually a node
represents an ...

#### The Generalized Method of Moments for Mixture and Mixed Models

(University of Waterloo, 2015-09-28)

Mixture models can be found in a wide variety of statistical applications. However, undertaking statistical inference in mixture models, especially non-parametric mixture models, can be challenging. A general, or nonparametric, ...

#### On the local positivity of line bundles on algebraic surfaces

(University of Waterloo, 2015-01-09)

In this thesis, we define a measure for how `positive' an effective line bundle is at a point on a variety, and prove that it is linear on the numerically effective subcone on a smooth, complete, toric surface.

#### Reconfiguring Triangulations

(University of Waterloo, 2015-01-06)

The results in this thesis lie at the confluence of triangulations and reconfiguration. We make the observation that certain solved and unsolved problems about triangulations can be cast as reconfiguration problems. We ...

#### On Reconfiguration Problems: Structure and Tractability

(University of Waterloo, 2015-02-18)

Given an n-vertex graph G and two vertices s and t in G, determining whether there exists a path and computing the length of the shortest path between s and t are two of the most fundamental graph problems. In the classical ...

#### Large eddy simulations and subgrid scale motions in stratified turbulence

(University of Waterloo, 2015-03-18)

Direct numerical and large eddy simulations (DNS $\&$ LES) of decaying and forced stratified turbulence are studied in this thesis. By defining a test filter scale $k_c$ in the horizontal and vertical directions separately, ...

#### Diameter and Rumour Spreading in Real-World Network Models

(University of Waterloo, 2015-04-20)

The so-called 'small-world phenomenon', observed in many real-world networks, is that there is a short path between any two nodes of a network, whose length is much smaller that the network's size, typically growing as a ...

#### Actuarial Ratemaking in Agricultural Insurance

(University of Waterloo, 2015-08-06)

A scientific agricultural (re)insurance pricing approach is essential for maintaining sustainable and viable risk management solutions for different stakeholders including farmers, governments, insurers, and reinsurers. ...