Now showing items 2463-2482 of 2985

    • Shape Modeling of Plant Leaves with Unstructured Meshes 

      Hong, Sung Min (University of Waterloo, 2005)
      The plant leaf is one of the most challenging natural objects to be realistically depicted by computer graphics due to its complex morphological and optical characteristics. Although many studies have been done on plant ...
    • Sharing Rewards Based on Subjective Opinions 

      Carvalho, Arthur (University of Waterloo, 2010-08-10)
      Fair division is the problem of dividing one or several goods among a set of agents in a way that satisfies a suitable fairness criterion. Traditionally studied in economics, philosophy, and political science, fair division ...
    • Short Directed Cycles in Bipartite Digraphs 

      Seymour, Paul; Spirkl, Sophie (Springer Nature, 2020-08-01)
      The Caccetta-Häggkvist conjecture implies that for every integer k ≥ 1, if G is a bipartite digraph, with n vertices in each part, and every vertex has out-degree more than n/(k+1), then G has a directed cycle of length ...
    • Short-wave vortex instabilities in stratified flow 

      Bovard, Luke (University of Waterloo, 2013-12-17)
      Density stratification is one of the essential underlying physical mechanisms for atmospheric and oceanic flow. As a first step to investigating the mechanisms of stratified turbulence, linear stability plays a critical ...
    • Short-wave vortex instability in stratified flow 

      Bovard, Luke; Waite, Michael L (Elsevier, 2016-01)
      In this paper we investigate a new instability of the Lamb–Chaplygin dipole in a stratified fluid. Through numerical linear stability analysis, a secondary peak in the growth rate emerges at vertical scales about an order ...
    • Shortest Path Queries in Very Large Spatial Databases 

      Zhang, Ning (University of Waterloo, 2001)
      Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly ...
    • Shortest Paths in Geometric Intersection Graphs 

      Skrepetos, Dimitrios (University of Waterloo, 2018-06-29)
      This thesis studies shortest paths in geometric intersection graphs, which can model, among others, ad-hoc communication and transportation networks. First, we consider two classical problems in the field of algorithms, ...
    • Sidon and Kronecker-like sets in compact abelian groups 

      Yang, Xu (University of Waterloo, 2019-06-07)
      Let $G$ be a compact abelian group and $\Ga$ be its discrete dual group. In this thesis we study various types of interpolation sets. A subset $E \subset \Ga$ is Sidon if every bounded function on $E$ can be interpolated ...
    • Sieve estimation in a Markov illness-death process under dual censoring 

      Cook, Richard J.; Boruvka, Audrey (Oxford Journals, 2016-02-29)
      Semiparametric methods are well-established for the analysis of a progressive Markov illness-death process observed up to a noninformative right censoring time. However often the intermediate and terminal events are ...
    • Sift: Achieving Resource-Efficient Consensus with RDMA 

      Kazhamiaka, Mikhail (University of Waterloo, 2019-04-30)
      Sift is a new consensus protocol for replicating state machines. It disaggregates CPU and memory consumption by creating a novel system architecture enabled by one-sided RDMA operations. We show that this system architecture ...
    • The Sigma-Delta Modulator as a Chaotic Nonlinear Dynamical System 

      Campbell, Donald O. (University of Waterloo, 2007-01-23)
      The sigma-delta modulator is a popular signal amplitude quantization error (or noise) shaper used in oversampling analogue-to-digital and digital-to-analogue converter systems. The shaping of the noise frequency spectrum ...
    • Signature Schemes in the Quantum Random-Oracle Model 

      Eaton, Edward (University of Waterloo, 2017-04-25)
      A signature scheme is a fundamental component in modern digital communication. It allows for authenticated messages, without which it would be nearly impossible to ensure security when using most modern technologies. ...
    • Significant Feature Clustering 

      Whissell, John (University of Waterloo, 2006)
      In this thesis, we present a new clustering algorithm we call <em>Significance Feature Clustering</em>, which is designed to cluster text documents. Its central premise is the mapping of raw frequency count vectors ...
    • Signing with Codes 

      Masárová, Zuzana (University of Waterloo, 2014-01-22)
      Code-based cryptography is an area of classical cryptography in which cryptographic primitives rely on hard problems and trapdoor functions related to linear error-correcting codes. Since its inception in 1978, the area ...
    • Signorini conditions for inviscid fluids 

      Gu, Yu (University of Waterloo, 2021-06-28)
      In this thesis, we present a new type of boundary condition for the simulation of inviscid fluids – the Signorini boundary condition. The new condition models the non-sticky contact of a fluid with other fluids or solids. ...
    • Similarity and Diversity in Information Retrieval 

      Akinyemi, John (University of Waterloo, 2012-04-30)
      Inter-document similarity is used for clustering, classification, and other purposes within information retrieval. In this thesis, we investigate several aspects of document similarity. In particular, we investigate the ...
    • Simple Convolutional Neural Networks with Linguistically-Annotated Input for Answer Selection in Question Answering 

      Sequiera, Royal (University of Waterloo, 2018-08-10)
      With the advent of deep learning methods, researchers have been increasingly preferring deep learning methods over decades-old feature-engineering-inspired work in Natural Language Processing (NLP). The research community ...
    • Simple Drawings of Kn from Rotation Systems 

      Sullivan, Matthew A. (University of Waterloo, 2021-10-06)
      A complete rotation system on n vertices is a collection of n cyclic permutations of the elements [n]\{i}, for i∈[n]. If D is a drawing of a labelled graph, then a rotation at vertex v is the cyclic ordering of the edges ...
    • A simple finite volume method for adaptive viscous liquids 

      Batty, Christopher; Houston, Ben (Association for Computing Machinery, 2011-08)
      We present the first spatially adaptive Eulerian fluid animation method to support challenging viscous liquid effects such as folding, coiling, and variable viscosity. We propose a tetrahedral node-based embedded finite ...
    • Simple Termination Criteria for Stochastic Gradient Descent Algorithm 

      Baghal, Sina (University of Waterloo, 2021-04-09)
      Stochastic gradient descent (SGD) algorithm is widely used in modern mathematical optimization. Because of its scalability and ease of implementation, SGD is usually preferred to other methods including the gradient descent ...

      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