Now showing items 154-173 of 1505

    • Biologically inspired methods in speech recognition and synthesis: closing the loop 

      Bekolay, Trevor (University of Waterloo, 2016-02-18)
      Current state-of-the-art approaches to computational speech recognition and synthesis are based on statistical analyses of extremely large data sets. It is currently unknown how these methods relate to the methods that ...
    • Biologically Plausible Neural Learning using Symmetric Predictive Estimators 

      Xu, David (University of Waterloo, 2016-08-04)
      A predictive estimator (PE) is a neural microcircuit hypothesized to explain how the brain processes certain types of information. They participate in a hierarchy, passing predictions to lower layers, which send back ...
    • Biologically Plausible, Human-scale Knowledge Representation 

      Crawford, Eric (University of Waterloo, 2014-08-22)
      Several approaches to implementing symbol-like representations in neurally plausible models have been proposed. These approaches include binding through synchrony, mesh binding, and tensor product binding. Recent theoretical ...
    • BioSpec: A Biophysically-Based Spectral Model of Light Interaction with Human Skin 

      Krishnaswamy, Aravind (University of Waterloo, 2005)
      Despite the notable progress in physically-based rendering, there is still a long way to go before we can automatically generate predictable images of biological materials. In this thesis, we address an open problem in ...
    • Bitemporal Sliding Windows 

      Ge, Chang (University of Waterloo, 2014-04-29)
      The bitemporal data model associates two time intervals with each record - system time and application time - denoting the validity of the record from the perspective of the database and of the real world, respectively. ...
    • BotChase: Graph-Based Bot Detection Using Machine Learning 

      Abou Daya, Abbas (University of Waterloo, 2019-05-21)
      Bot detection using machine learning (ML), with network flow-level features, has been extensively studied in the literature. However, existing flow-based approaches typically incur a high computational overhead and do not ...
    • Bounds on Maximum Matchings in 1-Planar Graphs 

      Wittnebel, John (University of Waterloo, 2019-01-29)
      In this thesis, we study lower bounds on maximum matchings in 1-planar graphs. We expand upon the tools used for proofs of matching bounds in other classes of graphs as well as some original ideas in order to find these ...
    • BridgeSPA: A Single Packet Authorization System for Tor Bridges 

      Smits, Rob (University of Waterloo, 2012-01-10)
      Tor is a network designed for low-latency anonymous communications. Tor clients form circuits through relays that are listed in a public directory, and then relay their encrypted traffic through these circuits. This ...
    • Bridging Technical Spaces: Model Translation from TA to XMI and Back Again 

      Hildebrand, Kristina (University of Waterloo, 2006)
      There are many different techniques and notations for extracting architecturally interesting information from the source code of existing software systems. This process is known as reverse engineering. One current ...
    • BSML-mbeddr: Integrating Semantically Congurable State-Machine Models in a C Programming Environment 

      Luo, Zhaoyi; Atlee, Joanne M. (ACM, 2016-11)
      In model-driven engineering, developers express their solutions in domain-specific modelling languages (DSLs) that support domain-specific abstractions. Big-Step Modelling Languages (BSML) is a family of extended state-machine ...
    • Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs 

      Tracey, Justin (University of Waterloo, 2017-10-30)
      Tor is the most popular tool for providing online anonymity. It is used by journalists, activists, and privacy-conscious individuals to provide low-latency private access to the Internet. However, Tor’s specific design and ...
    • Building a Framework for High-performance In-memory Message-Oriented Middleware 

      Hoang, Huy (University of Waterloo, 2019-11-28)
      Message-Oriented Middleware (MOM) is a popular class of software used in many distributed applications, ranging from business systems and social networks to gaming and streaming media services. As workloads continue to ...
    • Building a larger class of graphs for efficient reconfiguration of vertex colouring 

      Merkel, Owen (University of Waterloo, 2020-05-13)
      A $k$-colouring of a graph $G$ is an assignment of at most $k$ colours to the vertices of $G$ so that adjacent vertices are assigned different colours. The reconfiguration graph of the $k$-colourings, $\mathcal{R}_k(G)$, ...
    • Building Efficient Software to Support Content Delivery Services 

      Cassell, Benjamin (University of Waterloo, 2019-08-28)
      Many content delivery services use key components such as web servers, databases, and key-value stores to serve content over the Internet. These services, and their component systems, face unique modern challenges. Services ...
    • Bulk Scattering Approximations for Collimated Light Transmitted through Paper 

      Chen, Tenn Francis (University of Waterloo, 2009-01-21)
      Paper is a complex fibrous material whose production involves substantial amounts of natural and industrial resources. To reduce its manufacturing costs, the pulp and paper industry often employs optical technology such ...
    • Business Policy Modeling and Enforcement in Relational Database Systems 

      Ataullah, Ahmed Ayaz (University of Waterloo, 2014-05-12)
      Database systems maintain integrity of the stored information by ensuring that modifications to the database comply with constraints designed by the administrators. As the number of users and applications sharing a common ...
    • Cache Design for a Hardware Accelerated Sparse Texture Storage System 

      Yee, Wai Min (University of Waterloo, 2004)
      Hardware texture mapping is essential for real-time rendering. Unfortunately the memory bandwidth and latency often bounds performance in current graphics architectures. Bandwidth consumption can be reduced by ...
    • Cache Oblivious Data Structures 

      Ohashi, Darin (University of Waterloo, 2001)
      This thesis discusses cache oblivious data structures. These are structures which have good caching characteristics without knowing Z, the size of the cache, or L, the length of a cache line. Since the structures do ...
    • Cache-Aware Virtual Page Management 

      Szlavik, Alexander (University of Waterloo, 2013-02-22)
      With contemporary research focusing its attention primarily on benchmark-driven performance evaluation, studying fundamental memory characteristics has gone by the way-side. This thesis presents a systematic study of the ...
    • Cache-Oblivious Searching and Sorting in Multisets 

      Farzan, Arash (University of Waterloo, 2004)
      We study three problems related to searching and sorting in multisets in the cache-oblivious model: Finding the most frequent element (the mode), duplicate elimination and finally multi-sorting. We are interested in ...

      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