Now showing items 826-845 of 1453

    • Naive Bayes Data Complexity and Characterization of Optima of the Unsupervised Expected Likelihood 

      Wytsma, Alexandra (University of Waterloo, 2017-09-21)
      The naive Bayes model is a simple model that has been used for many decades, often as a baseline, for both supervised and unsupervised learning. With a latent class variable it is one of the simplest latent variable models, ...
    • Nature vs. Stress: Investigating the Use of Biophilia in Non-Violent Exploration Games to Reduce Stress 

      Reetz, Adrian; Valtchanov, Deltcho; Barnett-Cowan, Michael; Hancock, Mark; Wallace, James R (ACM, 2021)
      Games hold the potential to help many address health-related issues such as chronic stress. We investigated the use of biophilia, an affective response to nature grounded in the psychology literature, as indirect physiological ...
    • Nested pessimistic transactions for both atomicity and synchronization in concurrent software 

      Chammah, Tarek (University of Waterloo, 2011-10-04)
      Existing atomic section interface proposals, thus far, have tended to only isolate transactions from each other. Less considered is the coordination of threads performing transactions with respect to one another. Synchronization ...
    • Network Bargaining: Creating Stability Using Blocking Sets 

      Steiner, David (University of Waterloo, 2012-01-20)
      Bargaining theory seeks to answer the question of how to divide a jointly generated surplus between multiple agents. John Nash proposed the Nash Bargaining Solution to answer this question for the special case of two agents. ...
    • A Network Integrated Design for Micro-scale Cloud Services 

      Abdel-hadi, Ashraf (University of Waterloo, 2022-05-25)
      We present Falcon, network-integrated scheduler for micro-scale services. Falcon follows a centralized scheduler design to achieve high scheduling efficiency and leverages modern programmable switches to lower the scheduling ...
    • Network Performance Improvements for Low-Latency Anonymity Networks 

      Al-Sabah, Mashael (University of Waterloo, 2013-04-22)
      While advances to the Internet have enabled users to easily interact and exchange information online, they have also created several opportunities for adversaries to prey on users’ private information. Whether the motivation ...
    • Network-Accelerated Linearizable Reads 

      Takruri, Hatem (University of Waterloo, 2019-08-07)
      This thesis present FLAIR, a novel approach for accelerating read operations in leader-based consensus protocols. FLAIR leverages the capabilities of the new generation of programmable switches to serve reads from follower ...
    • Network-accelerated Scheduling for Large Clusters 

      Kettaneh, Ibrahim (University of Waterloo, 2020-05-04)
      We explore a novel design approach for accelerating schedulers for large scale clusters. Our approach follows a centralized design and leverages the programmability of recent programmable switches to accelerating scheduling ...
    • NeuRA: Using Neural Networks to Improve WiFi Rate Adaptation 

      Khastoo, Shervin (University of Waterloo, 2020-09-04)
      Although a variety of rate adaptation algorithms have been proposed for 802.11 devices, sampling-based algorithms are preferred and used in practice because they only require frame loss information which is available on ...
    • A neural modelling approach to investigating general intelligence 

      Rasmussen, Daniel (University of Waterloo, 2010-08-06)
      One of the most well-respected and widely used tools in the study of general intelligence is the Raven's Progressive Matrices test, a nonverbal task wherein subjects must induce the rules that govern the patterns in an ...
    • Neural Text Generation from Structured and Unstructured Data 

      Shahidi, Hamidreza (University of Waterloo, 2019-08-28)
      A number of researchers have recently questioned the necessity of increasingly complex neural network (NN) architectures. In particular, several recent papers have shown that simpler, properly tuned models are at least ...
    • A New Addressing and Forwarding Architecture for the Internet 

      Guo, Cong (University of Waterloo, 2011-10-03)
      The current Internet routing and addressing architecture is facing a serious scalability problem. The default free zone (DFZ) routing table size grows at an increasing and potentially alarming rate. The Internet architecture ...
    • New Algorithms for Predicting Conformational Polymorphism and Inferring Direct Couplings for Side Chains of Proteins 

      Soltan Ghoraie, Laleh (University of Waterloo, 2015-08-20)
      Protein crystals populate diverse conformational ensembles. Despite much evidence that there is widespread conformational polymorphism in protein side chains, most of the xray crystallography data are modelled by single ...
    • New Approaches to Protein NMR Automation 

      Alipanahi Ramandi, Babak (University of Waterloo, 2011-11-16)
      The three-dimensional structure of a protein molecule is the key to understanding its biological and physiological properties. A major problem in bioinformatics is to efficiently determine the three-dimensional structures ...
    • New Approaches to Protein Structure Prediction 

      Li, Shuai Cheng (University of Waterloo, 2009-11-06)
      Protein structure prediction is concerned with the prediction of a protein's three dimensional structure from its amino acid sequence. Such predictions are commonly performed by searching the possible structures and ...
    • New Design and Analysis Techniques for Post-Quantum Cryptography 

      Eaton, Edward (University of Waterloo, 2022-09-16)
      Due to the threat of scalable quantum computation breaking existing public-key cryptography, interest in post-quantum cryptography has exploded in the past decade. There are two key aspects to the mitigation of the quantum ...
    • A New Measure For Clustering Model Selection 

      McCrosky, Jesse (University of Waterloo, 2008-05-20)
      A new method for determining the number of k-means clusters in a given data set is presented. The algorithm is developed from a theoretical perspective and then its implementation is examined and compared to existing solutions.
    • New methods for Quantum Compiling 

      Kliuchnikov, Vadym (University of Waterloo, 2014-04-30)
      The efficiency of compiling high-level quantum algorithms into instruction sets native to quantum computers defines the moment in the future when we will be able to solve interesting and important problems on quantum ...
    • A New Optimality Measure for Distance Dominating Sets 

      Simjour, Narges (University of Waterloo, 2006)
        We study the problem of finding the smallest power of an input graph that has <em>k</em> disjoint dominating sets, where the <em>i</em>th power of an input graph <em>G</em> is constructed by adding edges between pairs ...
    • Niceness assumptions for Learning Algorithms 

      Kushagra, Shrinu (University of Waterloo, 2014-08-01)
      Various machine learning algorithms like Neural Networks, Linear Regression, Feature Learning etc. are being employed successfully in a wide variety of applications like computer vision, speech recognition, bioinformatics ...


      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