Now showing items 1-5 of 5
Combinatorial Problems in Compiler Optimization
(University of Waterloo, 2013-04-22)
Several important compiler optimizations such as instruction scheduling and register allocation are fundamentally hard and are usually solved using heuristics or approximate solutions. In contrast, this thesis examines ...
Reducing the Cost of Operating a Datacenter Network
(University of Waterloo, 2012-05-01)
Datacenters are a significant capital expense for many enterprises. Yet, they are difficult to manage and are hard to design and maintain. The initial design of a datacenter network tends to follow vendor guidelines, but ...
Integrating Skips and Bitvectors for List Intersection
(University of Waterloo, 2014-11-20)
This thesis examines space-time optimizations of in-memory search engines. Search engines can answer queries quickly, but this is accomplished using significant resources in the form of multiple machines running concurrently. ...
Constrained Shortest Paths in Terrains and Graphs
(University of Waterloo, 2009-10-28)
Finding a shortest path is one of the most well-studied optimization problems. In this thesis we focus on shortest paths in geometric and graph theoretic settings subject to different feasibility constraints that arise in ...
Effective and Efficient Optimization Methods for Kernel Based Classification Problems
(University of Waterloo, 2014-04-22)
Kernel methods are a popular choice in solving a number of problems in statistical machine learning. In this thesis, we propose new methods for two important kernel based classification problems: 1) learning from highly ...