Browsing Mathematics (Faculty of) by Title
Now showing items 1754-1773 of 2993
-
New Convex Relaxations for the Maximum Cut and VLSI Layout Problems
(University of Waterloo, 2001)It is well known that many of the optimization problems which arise in applications are <I>hard</I>, which usually means that they are NP-hard. Hence much research has been devoted to finding <I>good</I> relaxations for ... -
A New Addressing and Forwarding Architecture for the Internet
(University of Waterloo, 2011-10-03)The current Internet routing and addressing architecture is facing a serious scalability problem. The default free zone (DFZ) routing table size grows at an increasing and potentially alarming rate. The Internet architecture ... -
New Algorithms for Predicting Conformational Polymorphism and Inferring Direct Couplings for Side Chains of Proteins
(University of Waterloo, 2015-08-20)Protein crystals populate diverse conformational ensembles. Despite much evidence that there is widespread conformational polymorphism in protein side chains, most of the xray crystallography data are modelled by single ... -
New Approaches to Protein NMR Automation
(University of Waterloo, 2011-11-16)The three-dimensional structure of a protein molecule is the key to understanding its biological and physiological properties. A major problem in bioinformatics is to efficiently determine the three-dimensional structures ... -
New Approaches to Protein Structure Prediction
(University of Waterloo, 2009-11-06)Protein structure prediction is concerned with the prediction of a protein's three dimensional structure from its amino acid sequence. Such predictions are commonly performed by searching the possible structures and ... -
A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem
(University of Waterloo, 2010-09-29)The Time-Dependent Traveling Salesman Problem is a generalization of the well-known Traveling Salesman Problem, where the cost for travel between two nodes is dependent on the nodes and their position in the tour. Inequalities ... -
New Design and Analysis Techniques for Post-Quantum Cryptography
(University of Waterloo, 2022-09-16)Due to the threat of scalable quantum computation breaking existing public-key cryptography, interest in post-quantum cryptography has exploded in the past decade. There are two key aspects to the mitigation of the quantum ... -
A new framework for clustering
(University of Waterloo, 2010-04-07)The difficulty of clustering and the variety of clustering methods suggest the need for a theoretical study of clustering. Using the idea of a standard statistical framework, we propose a new framework for clustering. ... -
A New Measure For Clustering Model Selection
(University of Waterloo, 2008-05-20)A new method for determining the number of k-means clusters in a given data set is presented. The algorithm is developed from a theoretical perspective and then its implementation is examined and compared to existing solutions. -
New Methods for Improving Accuracy in Three Distinct Predictive Modeling Problems
(University of Waterloo, 2018-08-22)People are often interested in predicting a new or future observation. In clinical prediction, the uptake of Electronic Health Records (EHRs) has generated massive health datasets that are big in volume and diverse in ... -
New methods for Quantum Compiling
(University of Waterloo, 2014-04-30)The efficiency of compiling high-level quantum algorithms into instruction sets native to quantum computers defines the moment in the future when we will be able to solve interesting and important problems on quantum ... -
A New Optimality Measure for Distance Dominating Sets
(University of Waterloo, 2006)We study the problem of finding the smallest power of an input graph that has <em>k</em> disjoint dominating sets, where the <em>i</em>th power of an input graph <em>G</em> is constructed by adding edges between pairs ... -
A new perspective on loss to follow-up in failure time and life history studies
(Wiley, 2019-07-24)A framework is proposed for the joint modeling of life history and loss to follow-up (LTF) processes in cohort studies. This framework provides a basis for discussing independence conditions for LTF and censoring and ... -
Niceness assumptions for Learning Algorithms
(University of Waterloo, 2014-08-01)Various machine learning algorithms like Neural Networks, Linear Regression, Feature Learning etc. are being employed successfully in a wide variety of applications like computer vision, speech recognition, bioinformatics ... -
Nine Challenges In Incorporating The Dynamics Of Behaviour In Infectious Diseases Models
(Elsevier, 2015-03-01)Traditionally, the spread of infectious diseases in human populations has been modelled with static parameters. These parameters, however, can change when individuals change their behaviour. If these changes are themselves ... -
No Zombie Types: Liveness-Based Justification For Monotonic Gradual Types
(University of Waterloo, 2021-08-24)Gradual type systems with the monotonic dynamic semantics, such as HiggsCheck implementing SafeTypeScript, are able to achieve decent performance, making them a viable option for JavaScript programmers seeking run-time-checkable ... -
NOCH: A framework for biologically plausible models of neural motor control
(University of Waterloo, 2010-01-20)This thesis examines the neurobiological components of the motor control system and relates it to current control theory in order to develop a novel framework for models of motor control in the brain. The presented framework ... -
Node-Weighted Prize Collecting Steiner Tree and Applications
(University of Waterloo, 2013-05-23)The Steiner Tree problem has appeared in the Karp's list of the first 21 NP-hard problems and is well known as one of the most fundamental problems in Network Design area. We study the Node-Weighted version of the Prize ... -
Noisy Embezzlement of Entanglement and Applications to Entanglement Dilution
(University of Waterloo, 2019-05-23)In this thesis we present the concept of embezzlement of entanglement, its properties, efficiency, possible generalizations and propose the linear programming characterization of this phenomenon. Then, we focus on the noisy ... -
Noisy Interactive Quantum Communication
(University of Waterloo, 2020-08-25)We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n ...