Browsing Mathematics (Faculty of) by Title
Now showing items 10081027 of 2993

Fast and Scalable Solvers for the Fluid Pressure Equations with Separating Solid Boundary Conditions
(University of Waterloo, 20210601)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
(Wiley, 202005)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
(University of Waterloo, 20150828)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
(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 MultiLevel CoClustering
(2013)We present a new multilevel method for hierarchical coclustering. The fast multilevel coclustering method (FMCC) implements a bicoarsening 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
(University of Waterloo, 20130128)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 Nonuniform Input Arrival Times
(Springer Nature, 2017)We consider the problem of constructing fast and small parallel prefix adders for nonuniform 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 solidfluid coupling
(Association for Computing Machinery, 200707)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 EdgeWeighted Interval Graphs
(University of Waterloo, 20170427)Interval graphs—the intersection graphs of onedimensional 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
(University of Waterloo, 20220509)Sparse polynomials are those polynomials with only a few nonzero 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
(University of Waterloo, 20240130)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 AllOptical Mesh Networks
(University of Waterloo, 20130523)Fault management is a challenging task in alloptical 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
(University of Waterloo, 20160121)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
(University of Waterloo, 20200804)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
(Elsevier, 201905)We present a computationally inexpensive, flexible feature identification method which uses a comparison of time series to identify a rankordered set of features in geophysicallysourced data sets. Many physical phenomena ... 
A Feature Interaction Resolution Scheme Based on Controlled Phenomena
(University of Waterloo, 20140515)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
(University of Waterloo, 20080828)<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 domainspecific ... 
Feature Selection for Gene Expression Data Based on HilbertSchmidt Independence Criterion
(University of Waterloo, 20100525)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 FeatureOriented Modelling Language and a FeatureInteraction Taxonomy for ProductLine Requirements
(University of Waterloo, 20131218)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 MultiThreaded Memory Allocator
(University of Waterloo, 20080121)Multiprocessor computers are becoming increasingly popular and are important for improving application performance. Providing highperformance memorymanagement is important for multithreaded programs. This thesis looks ...