Browsing Mathematics (Faculty of) by Title
Now showing items 998-1017 of 2993
-
FACES OF MATCHING POLYHEDRA
(University of Waterloo, 2016-09-30)Let G = (V, E, ~) be a finite loopless graph, let b=(bi:ieV) be a vector of positive integers. A feasible matching is a vector X = (x.: j e: E) J of nonnegative integers such that for each node i of G, the sum of ... -
Facilitating Information Access for Heterogeneous Data Across Many Languages
(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 ... -
Failure Time Analysis with Discrete Marker Processes under Intermittent Observation
(University of Waterloo, 2021-07-28)Regression analysis for failure time data is often directed at studying the relationship between a time-dependent biomarker and failure. The Cox regression model and the associated partial likelihood on which inference ... -
Failure time studies with intermittent observation and losses to follow-up
(Wiley, 2020-12-01)In health research interest often lies in modeling a failure time process but in many cohort studies failure status is only determined at scheduled assessment times. While the assessment times may be fixed upon study entry, ... -
FairBlock: Preventing Blockchain Front-running with Minimal Overheads
(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 ... -
Families of Thue Inequalities with Transitive Automorphisms
(University of Waterloo, 2014-06-17)A family of parameterized Thue equations is defined as F_{t,s,...}(X, Y ) = m, m ∈ Z where F_{t,s,...}(X,Y) is a form in X and Y with degree greater than or equal to 3 and integer coefficients that are parameterized by ... -
Fast algorithms for computing with integer matrices: normal forms and applications
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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 ...