Now showing items 1-20 of 436

    • Differential Equations and Depth First Search for Enumeration of Maps in Surfaces 

      Brown, Daniel (University of Waterloo, 1999)
      A map is an embedding of the vertices and edges of a graph into a compact 2-manifold such that the remainder of the surface has components homeomorphic to open disks. With the goal of proving the Four Colour Theorem, ...
    • Matrix Formulations of Matching Problems 

      Webb, Kerri (University of Waterloo, 2000)
      Finding the maximum size of a matching in an undirected graph and finding the maximum size of branching in a directed graph can be formulated as matrix rank problems. The Tutte matrix, introduced by Tutte as a representation ...
    • Variational Spectral Analysis 

      Sendov, Hristo (University of Waterloo, 2000)
      We present results on smooth and nonsmooth variational properties of {it symmetric} functions of the eigenvalues of a real symmetric matrix argument, as well as {it absolutely symmetric} functions of the singular values ...
    • A survey on Traitor Tracing Schemes 

      Chen, Jason (University of Waterloo, 2000)
      When intellectual properties are distributed over a broadcast network, the content is usually encrypted in a way such that only authorized users who have a certain set of keys, can decrypt the content. Some authorized ...
    • A survey of the trust region subproblem within a semidefinite framework 

      Fortin, Charles (University of Waterloo, 2000)
      Trust region subproblems arise within a class of unconstrained methods called trust region methods. The subproblems consist of minimizing a quadratic function subject to a norm constraint. This thesis is a survey of ...
    • New Convex Relaxations for the Maximum Cut and VLSI Layout Problems 

      Ferreira Fialho dos Anjos, Miguel Nuno (University of Waterloo, 2001)
      It is well known that many of the optimization problems which arise in applications are <I>hard</I>, which usually means that they are NP-hard. Hence much research has been devoted to finding <I>good</I> relaxations for ...
    • Techniques of Side Channel Cryptanalysis 

      Muir, James (University of Waterloo, 2001)
      The traditional model of cryptography examines the security of cryptographic primitives as mathematical functions. This approach does not account for the physical side effects of using these primitives in the real world. ...
    • The Existence of Balanced Tournament Designs and Partitioned Balanced Tournament Designs 

      Bauman, Shane (University of Waterloo, 2001)
      A balanced tournament design of order <I>n</I>, BTD(<I>n</I>), defined on a 2<I>n</I>-set<I> V</i>, is an arrangement of the all of the (2<I>n</i>2) distinct unordered pairs of elements of <I>V</I> into an <I>n</I> X ...
    • Parking Functions and Related Combinatorial Structures. 

      Rattan, Amarpreet (University of Waterloo, 2001)
      The central topic of this thesis is parking functions. We give a survey of some of the current literature concerning parking functions and focus on their interaction with other combinatorial objects; namely noncrossing ...
    • Applications of Bilinear Maps in Cryptography 

      Gagne, Martin (University of Waterloo, 2002)
      It was recently discovered by Joux [30] and Sakai, Ohgishi and Kasahara [47] that bilinear maps could be used to construct cryptographic schemes. Since then, bilinear maps have been used in applications as varied as ...
    • Hamilton Paths in Generalized Petersen Graphs 

      Pensaert, William (University of Waterloo, 2002)
      This thesis puts forward the conjecture that for <i>n</i> > 3<i>k</i> with <i>k</i> > 2, the generalized Petersen graph, <i>GP</i>(<i>n,k</i>) is Hamilton-laceable if <i>n</i> is even and <i>k</i> is odd, and it is ...
    • Convergence Analysis of Generalized Primal-Dual Interior-Point Algorithms for Linear Optimization 

      Wei, Hua (University of Waterloo, 2002)
      We study the zeroth-, first-, and second-order algorithms proposed by Tuncel. The zeroth-order algorithms are the generalization of the classic primal-dual affine-scaling methods, and have a strong connection with the ...
    • Digital Signature Scheme Variations 

      Dunbar, Fiona (University of Waterloo, 2002)
      A digital signature scheme is the process of signing an electronic message that can be transmitted over a computer network. Digital signatures provide message authentication that can be proved to a third party. With ...
    • Continuous-time Quantum Algorithms: Searching and Adiabatic Computation 

      Ioannou, Lawrence (University of Waterloo, 2002)
      One of the most important quantum algorithms is Grover's search algorithm [G96]. Quantum searching can be used to speed up the search for solutions to NP-complete problems e. g. 3SAT. Even so, the best known quantum ...
    • Self-Dual Graphs 

      Hill, Alan (University of Waterloo, 2002)
      The study of self-duality has attracted some attention over the past decade. A good deal of research in that time has been done on constructing and classifying all self-dual graphs and in particular polyhedra. We ...
    • Perfect Hash Families: Constructions and Applications 

      Kim, Kyung-Mi (University of Waterloo, 2003)
      Let <b>A</b> and <b>B</b> be finite sets with |<b>A</b>|=<i>n</i> and |<b>B</b>|=<i>m</i>. An (<i>n</i>,<i>m</i>,<i>w</i>)-<i>perfect hash</i> family</i> is a collection <i>F</i> of functions from <b>A</b> to <b>B</b> ...
    • Postman Problems on Mixed Graphs 

      Zaragoza Martinez, Francisco Javier (University of Waterloo, 2003)
      The <i>mixed postman problem</i> consists of finding a minimum cost tour of a mixed graph <i>M</i> = (<i>V</i>,<i>E</i>,<i>A</i>) traversing all its edges and arcs at least once. We prove that two well-known linear ...
    • Uniqueness and Complexity in Generalised Colouring 

      Farrugia, Alastair (University of Waterloo, 2003)
      The study and recognition of graph families (or graph properties) is an essential part of combinatorics. Graph colouring is another fundamental concept of graph theory that can be looked at, in large part, as the recognition ...
    • An Optimizing Pulse Sequence Compiler for NMR QIP 

      Perez Delgado, Carlos Antonio (University of Waterloo, 2003)
      Quantum information processing is a multi-disciplinary science involving physics, mathematics, computer science, and even quantum chemistry. It is centred around the idea of manipulating physical systems at the quantum ...
    • Regularization Using a Parameterized Trust Region Subproblem 

      Grodzevich, Oleg (University of Waterloo, 2004)
      We present a new method for regularization of ill-conditioned problems that extends the traditional trust-region approach. Ill-conditioned problems arise, for example, in image restoration or mathematical processing of ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages