Now showing items 526-545 of 1575

    • Extracting Non-Functional Requirements from Unstructured Text 

      Ezami, Sahba (University of Waterloo, 2018-01-18)
      Non-functional requirements (NFRs) of a software system describe desired quality attributes rather than specific user-visible features; NFRs model stakeholder expectations about pervasive system properties such as performance, ...
    • Extremely fast (a,b)-trees at all contention levels 

      Srivastava, Anubhav (University of Waterloo, 2021-08-26)
      Many concurrent dictionary implementations are designed and evaluated with only low-contention workloads in mind. This thesis presents several concurrent linearizable (a,b)-tree implementations with the overarching goal ...
    • Effective Strategies for Improving Peptide Identification with Tandem Mass Spectrometry 

      Han, Xi (University of Waterloo, 2011-12-21)
      Tandem mass spectrometry (MS/MS) has been routinely used to identify peptides from protein mixtures in the field of proteomics. However, only about 30% to 40% of current MS/MS spectra can be identified, while many of them ...
    • Facilitating Cross-Lingual Information Retrieval Evaluations for African Languages 

      Adeyemi, Mofetoluwa (University of Waterloo, 2024-04-30)
      Web resources are becoming more available in various languages, increasing the importance of cross-lingual information retrieval (CLIR) in accessing information that is present in a different language. To support CLIR ...
    • Facilitating Information Access for Heterogeneous Data Across Many Languages 

      Shi, Peng (University of Waterloo, 2023-01-25)
      Information access, which enables people to identify, retrieve, and use information freely and effectively, has attracted interest from academia and industry. Systems for document retrieval and question answering have ...
    • FairBlock: Preventing Blockchain Front-running with Minimal Overheads 

      Momeni, Peyman (University of Waterloo, 2022-08-17)
      While blockchain systems are quickly gaining popularity, front-running remains a major obstacle to fair exchange. Front-running is a family of strategies in which a malicious party manipulates the order of transactions ...
    • Fast algorithms for computing with integer matrices: normal forms and applications 

      Birmpilis, Stavros (University of Waterloo, 2021-09-24)
      The focus of this thesis is on fundamental computational problems in exact integer linear algebra. Specifically, for a nonsingular integer input matrix A of dimension n, we consider problems such as linear system solving ...
    • Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module 

      Musleh, Yossef (University of Waterloo, 2018-09-21)
      This thesis introduces a new Monte Carlo randomized algorithm for computing the characteristic polynomial of a rank-2 Drinfeld module. We also introduce a deterministic algorithm that uses some ideas seen in Schoof's ...
    • Fast Algorithms for Large-Scale Phylogenetic Reconstruction 

      Truszkowski, Jakub (University of Waterloo, 2013-10-24)
      One of the most fundamental computational problems in biology is that of inferring evolutionary histories of groups of species from sequence data. Such evolutionary histories, known as phylogenies are usually represented ...
    • Fast and Robust Mathematical Modeling of NMR Assignment Problems 

      Jang, Richard (University of Waterloo, 2012-04-26)
      NMR spectroscopy is not only for protein structure determination, but also for drug screening and studies of dynamics and interactions. In both cases, one of the main bottleneck steps is backbone assignment. When a homologous ...
    • Fast and Scalable Solvers for the Fluid Pressure Equations with Separating Solid Boundary Conditions 

      Lai, Junyu (University of Waterloo, 2021-06-01)
      We propose and evaluate fast, scalable approaches for solving the linear complementarity problems (LCP) arising from the fluid pressure equations with separating solid boundary conditions. Specifically, we present a policy ...
    • Fast and Scalable Solvers for the Fluid Pressure Equations with Separating Solid Boundary Conditions 

      Lai, Junyu; Chen, Yangang; Gu, Yu; Batty, Christopher; Wan, Justin W.L. (Wiley, 2020-05)
      In this paper, we propose and evaluate fast, scalable approaches for solving the linear complementarity problems (LCP) arising from the fluid pressure equations with separating solid boundary conditions. Specifically, we ...
    • Fast Extraction of BRDFs and Material Maps from Images 

      Jaroszkiewicz, Rafal (University of Waterloo, 2003)
      The bidirectional reflectance distribution function has a four dimensional parameter space and such high dimensionality makes it impractical to use it directly in hardware rendering. When a BRDF has no analytical ...
    • Fast Multi-Level Co-Clustering 

      Xu, Haifeng (2013)
      We present a new multilevel method for hierarchical co-clustering. The fast multilevel co-clustering method (FMCC) implements a bi-coarsening process on the bipartite graph induced by the feature matrix. It does so in a ...
    • Fast Order Basis and Kernel Basis Computation and Related Problems 

      Zhou, Wei (University of Waterloo, 2013-01-28)
      In this thesis, we present efficient deterministic algorithms for polynomial matrix computation problems, including the computation of order basis, minimal kernel basis, matrix inverse, column basis, unimodular completion, ...
    • A fast variational framework for accurate solid-fluid coupling 

      Batty, Christopher; Bertails, Florence; Bridson, Robert (Association for Computing Machinery, 2007-07)
      Physical simulation has emerged as a compelling animation technique, yet current approaches to coupling simulations of fluids and solids with irregular boundary geometry are inefficient or cannot handle some relevant ...
    • A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs 

      Mahajan, Shikha (University of Waterloo, 2017-04-27)
      Interval graphs—the intersection graphs of one-dimensional intervals—are considered one of the most useful mathematical structures to model real life applications. Interval graphs have been widely studied since they first ...
    • Faster Algorithms for Sparse Decomposition and Sparse Series Solutions to Differential Equations 

      Lyu, Saiyue (University of Waterloo, 2022-05-09)
      Sparse polynomials are those polynomials with only a few non-zero coefficients relative to their degree. They can appear in practice in polynomial systems as inputs, where the degree of the input sparse polynomial can be ...
    • A Fault Injection Tool for Testing Distributed System with Network Faults 

      Khaleel, Seba (University of Waterloo, 2024-01-30)
      Modern systems are complex, they include hundreds of components that implement complex protocols such as scheduling, replication, membership, resource management, client access, and security. These systems are expected to ...
    • Fault Localization in All-Optical Mesh Networks 

      Ali, Mohammed Liakat (University of Waterloo, 2013-05-23)
      Fault management is a challenging task in all-optical wavelength division multiplexing (WDM) networks. However, fast fault localization for shared risk link groups (SRLGs) with multiple links is essential for building a ...


      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