Browsing Mathematics (Faculty of) by Title
Now showing items 120 of 2032

A 2Approximation for the Height of Maximal Outerplanar Graph Drawings
(University of Waterloo, 20160818)In this thesis, we study drawings of maximal outerplanar graphs that place vertices on integer coordinates. We introduce a new class of graphs, called umbrellas, and a new method of splitting maximal outerplanar graphs ... 
2crossing critical graphs with a V8 minor
(University of Waterloo, 20120117)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 kcrossing critical if it has crossing number k and any proper subgraph of G has a ... 
2Semilattices: Residual Properties and Applications to the Constraint Satisfaction Problem
(University of Waterloo, 20170822)Semilattices are algebras known to have an important connection to partially ordered sets. In particular, if a partially ordered set $(A,\leq)$ has greatest lower bounds, a semilattice $(A;\wedge)$ can be associated to the ... 
3D Reconstruction from Single Projections, with Applications to Astronomical Images
(University of Waterloo, 20130823)A variety of techniques exist for threedimensional reconstruction when multiple views are available, but less attention has been given to reconstruction when only a single view is available. Such a situation is normal in ... 
3D Online MultiObject Tracking for Autonomous Driving
(University of Waterloo, 20190829)This research work focuses on exploring a novel 3D multiobject tracking architecture: 'FANTrack: 3D MultiObject Tracking with Feature Association Network' for autonomous driving, based on tracking by detection and online ... 
3D Pointing with Everyday Devices: Speed, Occlusion, Fatigue
(University of Waterloo, 20150724)In recent years, display technology has evolved to the point where displays can be both nonstereoscopic and stereoscopic, and 3D environments can be rendered realistically on many types of displays. From movie theatres ... 
5Choosability of Planarplustwoedge Graphs
(University of Waterloo, 20180102)We prove that graphs that can be made planar by deleting two edges are 5choosable. To arrive at this, first we prove an extension of a theorem of Thomassen. Second, we prove an extension of a theorem Postle and Thomas. ... 
A+ Indexes: Highly Flexible Adjacency Lists in Graph Database Management Systems
(University of Waterloo, 20190917)Adjacency lists are the most fundamental storage structure in existing graph database management systems (GDBMSs) to index input graphs. Adjacency lists are universally linkedlist like pervertex structures that allow ... 
Abstract and Explicit Constructions of Jacobian Varieties
(University of Waterloo, 20180810)Abelian varieties, in particular Jacobian varieties, have long attracted interest in mathematics. Their influence pervades arithmetic geometry and number theory, and understanding their construction was a primary motivator ... 
Access Control Administration with Adjustable Decentralization
(University of Waterloo, 20070912)Access control is a key function of enterprises that preserve and propagate massive data. Access control enforcement and administration are two major components of the system. On one hand, enterprises are responsible for ... 
Achieving Performance Objectives for Database Workloads
(University of Waterloo, 20100830)In this thesis, our goal is to achieve customerspecified performance objectives for workloads in a database management system (DBMS). Competing workloads in current DBMSs have detrimental effects on performance. ... 
Action of degenerate Bethe operators on representations of the symmetric group
(University of Waterloo, 20180524)Degenerate Bethe operators are elements defined by explicit sums in the center of the group algebra of the symmetric group. They are useful on account of their relation to the GelfandZetlin algebra and the YoungJucysMurphy ... 
Active Learning with SemiSupervised Support Vector Machines
(University of Waterloo, 20070522)A significant problem in many machine learning tasks is that it is time consuming and costly to gather the necessary labeled data for training the learning algorithm to a reasonable level of performance. In reality, it is ... 
Active Sensing for Partially Observable Markov Decision Processes
(University of Waterloo, 20130121)Context information on a smart phone can be used to tailor applications for specific situations (e.g. provide tailored routing advice based on location, gas prices and traffic). However, typical contextaware smart phone ... 
Actuarial Inference and Applications of Hidden Markov Models
(University of Waterloo, 20110817)Hidden Markov models have become a popular tool for modeling longterm investment guarantees. Many different variations of hidden Markov models have been proposed over the past decades for modeling indexes such as the S&P ... 
Actuarial Ratemaking in Agricultural Insurance
(University of Waterloo, 20150806)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. ... 
Acyclic Colouring of Graphs on Surfaces
(University of Waterloo, 20180904)An acyclic kcolouring of a graph G is a proper kcolouring of G with no bichromatic cycles. In 1979, Borodin proved that planar graphs are acyclically 5colourable, an analog of the Four Colour Theorem. Kawarabayashi and ... 
Adhoc Holistic Ranking Aggregation
(University of Waterloo, 20121206)Data exploration is considered one of the major processes that enables the user to analyze massive amount of data in order to find the most important and relevant informa tion needed. Aggregation and Ranking are two of ... 
Adapting Component Analysis
(University of Waterloo, 20120518)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 ... 
Adaptive Algorithms for Weighted Queries on Weighted Binary Relations and Labeled Trees
(University of Waterloo, 20070730)Keyword queries are extremely easy for a user to write. They have become a standard way to query for information in web search engines and most other information retrieval systems whose users are usually laypersons and ...