Now showing items 1008-1027 of 2993

    • 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 Bootstrapping in Z_q 

      Ruiz Lopez, Luis A (University of Waterloo, 2015-08-28)
      In 2015, Ducas and Micciancio presented a novel technique to compute the NAND gate using the Learning With Errors cryptosystem (LWE), along with a novel bootstrapping technique that turns turns this cryptosystem into a ...
    • 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, ...
    • Fast Prefix Adders for Non-uniform Input Arrival Times 

      Held, Stephan; Spirkl, Sophie (Springer Nature, 2017)
      We consider the problem of constructing fast and small parallel prefix adders for non-uniform input arrival times. In modern computer chips, adders with up to hundreds of inputs occur frequently, and they are often embedded ...
    • 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 ...
    • Fault Tolerant Multitenant Database Server Consolidation 

      Mate, Joseph (University of Waterloo, 2016-01-21)
      Server consolidation is important in situations where a sequence of database tenants need to be allocated (hosted) dynamically on a minimum number of cloud server machines. Given a tenant’s load defined by the amount of ...
    • Feature Identification 

      Shaw, Justin (University of Waterloo, 2020-08-04)
      We present several methods for identifying time periods of interest (features) in a wide range of data sets. The gamma method is a computationally inexpensive, flexible feature identification method which uses a comparison ...
    • Feature identification in time series data sets 

      Shaw, Justin; Stastna, Marek; Coutino, Aaron; Walter, Ryan K.; Reinhardt, Eduard (Elsevier, 2019-05)
      We present a computationally inexpensive, flexible feature identification method which uses a comparison of time series to identify a rank-ordered set of features in geophysically-sourced data sets. Many physical phenomena ...
    • A Feature Interaction Resolution Scheme Based on Controlled Phenomena 

      Bocovich, Cecylia (University of Waterloo, 2014-05-15)
      Systems that are assembled from independently developed features suffer from feature interactions, in which features affect one another's behaviour in surprising ways. To ensure that a system behaves as intended, developers ...
    • Feature Model Mining 

      She, Steven (University of Waterloo, 2008-08-28)
      <p>Software systems have grown larger and more complex in recent years. Generative software development strives to automate software development from a systems family by generating implementations using domain-specific ...
    • Feature Selection for Gene Expression Data Based on Hilbert-Schmidt Independence Criterion 

      Zarkoob, Hadi (University of Waterloo, 2010-05-25)
      DNA microarrays are capable of measuring expression levels of thousands of genes, even the whole genome, in a single experiment. Based on this, they have been widely used to extend the studies of cancerous tissues to a ...
    • A Feature-Oriented Modelling Language and a Feature-Interaction Taxonomy for Product-Line Requirements 

      Shaker, Pourya (University of Waterloo, 2013-12-18)
      Many organizations specialize in the development of families of software systems, called software product lines (SPLs), for one or more domains (e.g., automotive, telephony, health care). SPLs are commonly developed as a ...
    • Features of a Multi-Threaded Memory Allocator 

      Wasik, Ayelet (University of Waterloo, 2008-01-21)
      Multi-processor computers are becoming increasingly popular and are important for improving application performance. Providing high-performance memory-management is important for multi-threaded programs. This thesis looks ...

      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