Now showing items 1137-1156 of 3009

    • Generalizing sampling theory for time-varying Nyquist rates using self-adjoint extensions of symmetric operators with deficiency indices (1,1) in Hilbert spaces 

      Hao, Yufang (University of Waterloo, 2011-09-30)
      Sampling theory studies the equivalence between continuous and discrete representations of information. This equivalence is ubiquitously used in communication engineering and signal processing. For example, it allows ...
    • Generating Functions for Hyperbolic Plane Tessellations 

      Xie, Jiale (University of Waterloo, 2017-08-28)
      For a hyperbolic plane tessellation there is a generating function with respect to the distance. This generating function is the same as the growth function of a group of isometries of hyperbolic plane that acts regularly ...
    • Generating patterns on clothing for seamless design 

      Kang, Clara (University of Waterloo, 2021-04-26)
      Symmetric patterns are used widely in clothing manufacture. However, the discontinuity of patterns at seams can disrupt the visual appeal of clothing. While it is possible to align patterns to conceal such pattern breaks, ...
    • Generating Radiosity Maps on the GPU 

      Moreno-Fortuny, Gabriel (University of Waterloo, 2005)
      Global illumination algorithms are used to render photorealistic images of 3D scenes taking into account both direct lighting from the light source and light reflected from other surfaces in the scene. Algorithms based ...
    • Generation and properties of random graphs and analysis of randomized algorithms 

      Gao, Pu (University of Waterloo, 2010-01-22)
      We study a new method of generating random $d$-regular graphs by repeatedly applying an operation called pegging. The pegging algorithm, which applies the pegging operation in each step, is a method of generating large ...
    • Generative Modeling with Neural Ordinary Differential Equations 

      Dockhorn, Tim (University of Waterloo, 2019-12-19)
      Neural ordinary differential equations (NODEs) (Chen et al., 2018) are ordinary differential equations (ODEs) with their dynamics modeled by neural networks. Continuous normalizing flows (CNFs) (Chen et al., 2018; Grathwohl ...
    • Generic Attacks on Hash Functions 

      Upadhyay, Jalaj (University of Waterloo, 2010-09-28)
      The subject of this thesis is a security property of hash functions, called chosen-target forced-prefix preimage (CTFP) resistance and the generic attack on this property, called the herding attack. The study of CTFP ...
    • Genetic Programming for the Evolution of Functions with a Discrete Unbounded Domain 

      Eastwood, Shawn (University of Waterloo, 2013-05-16)
      The idea of automatic programming using the genetic programming paradigm is a concept that has been explored in the work of Koza and several works since. Most problems attempted using genetic programming are finite in size, ...
    • Genus one partitions 

      Yip, Martha (University of Waterloo, 2006)
      We obtain a tight upper bound for the genus of a partition, and calculate the number of partitions of maximal genus. The generating series for genus zero and genus one rooted hypermonopoles is obtained in closed form ...
    • Geo-Phisher: The Design and Evaluation of Information Visualizations about Internet Phishing Trends 

      Zhang-Kennedy, Leah; Fares, Elias; Chiasson, Sonia; Biddle, Robert (IEEE, 2016-06)
      We designed an information visualization about phishing trends and phishing prevention for the general public to examine the effects of interactivity on information finding, user perceptions and security behaviour intentions, ...
    • Geodesic Convex Analysis of Group Scaling for the Paulsen Problem and the Tensor Normal Model 

      Ramachandran, Akshay (University of Waterloo, 2021-11-18)
      The framework of scaling problems has recently had much interest in the theoretical computer science community due to its variety of applications, from algebraic complexity to machine learning. In this thesis, our main ...
    • Geographically Distributed Database Management at the Cloud's Edge 

      Avram, Catalin (University of Waterloo, 2017-08-24)
      Request latency resulting from the geographic separation between clients and remote application servers is a challenge for cloud-hosted web and mobile applications. Numerous studies have shown the importance of low latency ...
    • A Geometric Approach to Pattern Matching in Polyphonic Music 

      Tanur, Luke (University of Waterloo, 2005)
      The music pattern matching problem involves finding matches of a small fragment of music called the "pattern" into a larger body of music called the "score". We represent music as a series of horizontal line segments in ...
    • Geometric Approximation Algorithms in the Online and Data Stream Models 

      Zarrabi-Zadeh, Hamid (University of Waterloo, 2008-10-23)
      The online and data stream models of computation have recently attracted considerable research attention due to many real-world applications in various areas such as data mining, machine learning, distributed computing, ...
    • A Geometric B-Spline Over the Triangular Domain 

      Ingram, Christopher (University of Waterloo, 2003)
      For modelling curves, B-splines [3] are among the most versatile control schemes. However, scaling this technique to surface patches has proven to be a non-trivial endeavor. While a suitable scheme exists for rectangular ...
    • Geometric On-line Ray Searching Under Probability of Placement Scenarios 

      Liu, Ying (University of Waterloo, 2010-09-28)
      Online computation is a model for formulating decision making under uncertainty. In an online problem, the algorithm does not know the entire input from the beginning; the input is revealed in a sequence of steps. At each ...
    • Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality 

      de Carli Silva, Marcel Kenji (University of Waterloo, 2013-08-30)
      The Lovasz theta function and the associated convex sets known as theta bodies are fundamental objects in combinatorial and semidefinite optimization. They are accompanied by a rich duality theory and deep connections ...
    • Geometrical Frustration and Static Correlations in a Simple Glass Former 

      Charbonneau, Benoit; Charbonneau, Patrick; Tarjus, Gilles (American Physical Society, 2012-01-18)
      We study the geometrical frustration scenario of glass formation for simple hard-sphere models. We find that the dual picture in terms of defects brings little insight and no theoretical simplification for the understanding ...
    • Geometrical frustration and static correlations in hard-sphere glass formers 

      Charbonneau, Benoit; Charbonneau, Patrick; Tarjus, Gilles (American Institute of Physics, 2013-03-28)
      We analytically and numerically characterize the structure of hard-sphere fluids in order to review various geometrical frustration scenarios of the glass transition. We find generalized polytetrahedral order to be correlated ...
    • Geometry of convex sets arising from hyperbolic polynomials 

      Myklebust, Tor Gunnar Josefsson Jay (University of Waterloo, 2008-09-09)
      This thesis focuses on convex sets and convex cones defined using hyperbolic polynomials. We first review some of the theory of convex sets in $\R^d$ in general. We then review some classical algebraic theorems concerning ...

      UWSpace

      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