Browsing Theses by Title
Now showing items 722-741 of 15526
-
Approaches and Techniques to Enhance Efficiency and Performance of Non-Contrastive Self-Supervised Learning Methods
(University of Waterloo, 2023-03-31)Self-supervised learning (SSL) methods have gained considerable attention in recent years due to their ability to learn useful representations of data without relying on labels during training. These methods have ... -
Approaches for Nonstationary Flood Frequency and Trend Analyses for Hydrometric Data
(University of Waterloo, 2018-09-10)Peak hydrometeorological events have been the topic of much concern in recent years, chiefly their frequency and magnitude. According to the Fifth Assessment Report by the Intergovernmental Panel on Climate Change (IPCC), ... -
Approaches to Tailoring the Structure and Properties of Polyethylene
(University of Waterloo, 2002)Alternative methods to control the molecular weight and short chain branching distribution of polyethylene were investigated. The ability to produce polyolefins with multimodal microstructural distributions using single ... -
Approaches to the Inhibition of Class II Fructose-1,6-Bisphosphate Aldolase
(University of Waterloo, 2009-05-22)Fructose-1,6-bisphosphate (FBP) aldolase (E.C. 4.1.2.13) catalyzes the reversible aldol condensation of dihydroxyacetonephosphate (DHAP) and glyceraldehyde-3-phosphate (G3P) in glycolysis, gluconeogenesis and the Calvin ... -
Approaches to understanding and measuring women’s empowerment and its relationship with women’s and children’s dietary diversity in sub-Saharan Africa.
(University of Waterloo, 2020-04-02)Background Women’s empowerment has been identified as a key component of development policies since in many cases, there are existing and widening gender gaps in wellbeing including in access to improved nutrition ... -
Approaches to “interculturality”, “transculturality” and “culture reflexivity” in self-help literature
(University of Waterloo, 2017-08-31)Intercultural competence which is to be achieved via intercultural trainings has become in-creasingly relevant during the last decades: globalization is one factor to the reason why the necessity to include intercultural ... -
Approaching Vertical: A Guide Through Land-Use in Ontario’s Niagara Escarpment
(University of Waterloo, 2018-01-22)Ontario’s Niagara Escarpment is a landscape 450 million years in the making. Over this immense time line, great natural forces of the earth have aggregated, eroded, and carved this landscape, a 725-kilometer scarp face ... -
Appropriateness of Imperfect CNFET Based Circuits for Error Resilient Computing Systems
(University of Waterloo, 2020-04-06)With superior device performance consistently reported in extremely scaled dimensions, low dimensional materials (LDMs), including Carbon Nanotube Field Effect Transistor (CNFET) based technology, have shown the potential ... -
Approximate Private Quantum Channels
(University of Waterloo, 2006)This thesis includes a survey of the results known for private and approximate private quantum channels. We develop the best known upper bound for ε-randomizing maps, <em>n</em> + 2log(1/ε) + <em>c</em> ... -
Approximately Optimum Search Trees in External Memory Models
(University of Waterloo, 2016-05-16)We examine optimal and near optimal solutions to the classic binary search tree problem of Knuth. We are given a set of n keys (originally known as words), B_1, B_2, ..., B_n and 2n+1 frequencies. {p_1, p_2, ..., p_n} ... -
Approximating Minimum-Size 2-Edge-Connected and 2-Vertex-Connected Spanning Subgraphs
(University of Waterloo, 2017-04-27)We study the unweighted 2-edge-connected and 2-vertex-connected spanning subgraph problems. A graph is 2-edge-connected if it is connected on removal of an edge, and it is 2-vertex-connected if it is connected on removal ... -
Approximating stable densities with Padé approximants and asymptotic series
(University of Waterloo, 2011-04-29)In this thesis, we are interested in using the Padé approximants and asymptotic series to approximate the density functions of the stable distributions. The paper specifically discusses the selection of the optimal degree ... -
An Approximation Algorithm for Character Compatibility and Fast Quartet-based Phylogenetic Tree Comparison
(University of Waterloo, 2000)Phylogenetic analysis, or the inference of evolutionary history is done routinely by biologists and is one of the most important problems in systematic biology. In this thesis, we study two computational problems in ... -
Approximation Algorithms for (S,T)-Connectivity Problems
(University of Waterloo, 2010-08-03)We study a directed network design problem called the $k$-$(S,T)$-connectivity problem; we design and analyze approximation algorithms and give hardness results. For each positive integer $k$, the minimum cost $k$-vertex ... -
Approximation Algorithms for Clustering and Facility Location Problems
(University of Waterloo, 2017-04-06)Facility location problems arise in a wide range of applications such as plant or warehouse location problems, cache placement problems, and network design problems, and have been widely studied in Computer Science and ... -
Approximation Algorithms for Distributionally Robust Stochastic Optimization
(University of Waterloo, 2019-05-15)Two-stage stochastic optimization is a widely used framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios, and decisions are taken in two stages: ... -
Approximation Algorithms for Geometric Covering Problems for Disks and Squares
(University of Waterloo, 2013-08-15)Geometric covering is a well-studied topic in computational geometry. We study three covering problems: Disjoint Unit-Disk Cover, Depth-(≤ K) Packing and Red-Blue Unit-Square Cover. In the Disjoint Unit-Disk Cover ... -
Approximation Algorithms for Graph Protection Problems
(University of Waterloo, 2015-05-22)We study a budgeted cut problem known as Graph Protection, where the goal is to remove edges of a given graph in order to protect valuable nodes from stochastic, infectious threats. This problem was recently proposed ... -
Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations
(University of Waterloo, 2015-07-29)Linear programming (LP) relaxations provide a powerful technique to design approximation algorithms for combinatorial optimization problems. In the first part of the thesis, we study the metric s-t path Traveling Salesman ... -
Approximation Algorithms for Rectangle Piercing Problems
(University of Waterloo, 2005)Piercing problems arise often in facility location, which is a well-studied area of computational geometry. The general form of the piercing problem discussed in this dissertation asks for the minimum number of facilities ...