Browsing Computer Science by Title
Now showing items 489508 of 1451

Facilitating Information Access for Heterogeneous Data Across Many Languages
(University of Waterloo, 20230125)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 Frontrunning with Minimal Overheads
(University of Waterloo, 20220817)While blockchain systems are quickly gaining popularity, frontrunning remains a major obstacle to fair exchange. Frontrunning 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
(University of Waterloo, 20210924)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 Rank2 Drinfeld Module
(University of Waterloo, 20180921)This thesis introduces a new Monte Carlo randomized algorithm for computing the characteristic polynomial of a rank2 Drinfeld module. We also introduce a deterministic algorithm that uses some ideas seen in Schoof's ... 
Fast Algorithms for LargeScale Phylogenetic Reconstruction
(University of Waterloo, 20131024)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
(University of Waterloo, 20120426)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
(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 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, ... 
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 ... 
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 ... 
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 ... 
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 ...