Now showing items 41-60 of 846

    • Applications of Description Logic and Causality in Model Checking 

      Ben-David, Shoham (University of Waterloo, 2009-06-19)
      Model checking is an automated technique for the verification of finite-state systems that is widely used in practice. In model checking, a model M is verified against a specification $\varphi$, exhaustively checking ...
    • Applications of Geometry in Optimization and Statistical Estimation 

      Maroufy, Vahed (University of Waterloo, 2016-01-25)
      Geometric properties of statistical models and their influence on statistical inference and asymptotic theory reveal the profound relationship between geometry and statistics. This thesis studies applications of convex ...
    • Applications of Operator Systems in Dynamics, Correlation Sets, and Quantum Graphs 

      Kim, Se Jin (University of Waterloo, 2020-07-24)
      The recent works of Kalantar-Kennedy, Katsoulis-Ramsey, Ozawa, and Dykema-Paulsen have demonstrated that many problems in the theory of operator algebras and quantum information can be approached by looking at various ...
    • Applications of Projection Pursuit in Functional Data Analysis: Goodness-of- fit, Forecasting, and Change-point Detection 

      Xie, Yijun (University of Waterloo, 2021-01-20)
      Dimension reduction methods for functional data have been avidly studied in recent years. However, existing methods are primarily based on summarizing the data by their projections into principal component subspaces, namely ...
    • Applications of Stochastic Control to Portfolio Selection Problems 

      Lin, Hongcan (University of Waterloo, 2018-10-16)
      Portfolio selection is an important problem both in academia and in practice. Due to its significance, it has received great attention and facilitated a large amount of research. This thesis is devoted to structuring optimal ...
    • Applications of the minimal modelprogram in arithmetic dynamics 

      Nasserden, Brett (University of Waterloo, 2021-09-07)
      Let F be a surjective endomorphism of a normal projective variety X defined over a number field. The dynamics of F may be studied through the dynamics of the linear action of an associated linear pull-back action on divisors. ...
    • Approximation Algorithms for Clustering and Facility Location Problems 

      Ahmadian, Sara (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 

      Linhares Rodrigues, Andre (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 Path TSP, ATSP, and TAP via Relaxations 

      Gao, Zhihan (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 Constants for Closed Subschemes of Projective Varieties 

      Rollick, Nickolas (University of Waterloo, 2019-06-19)
      Diophantine approximation is a branch of number theory with a long history, going back at least to the work of Dirichlet and Liouville in the 1840s. The innocent-looking question of how well an arbitrary real algebraic ...
    • Approximation, Proof Systems, and Correlations in a Quantum World 

      Gharibian, Sevag (University of Waterloo, 2012-08-29)
      This thesis studies three topics in quantum computation and information: The approximability of quantum problems, quantum proof systems, and non-classical correlations in quantum systems. Our first area of study concerns ...
    • Aspects of Metric Spaces in Computation 

      Skala, Matthew Adam (University of Waterloo, 2008-06-06)
      Metric spaces, which generalise the properties of commonly-encountered physical and abstract spaces into a mathematical framework, frequently occur in computer science applications. Three major kinds of questions about ...
    • Assessing Binary Measurement Systems 

      Danila, Oana Mihaela (University of Waterloo, 2012-01-19)
      Binary measurement systems (BMS) are widely used in both manufacturing industry and medicine. In industry, a BMS is often used to measure various characteristics of parts and then classify them as pass or fail, according ...
    • Assessing Binary Measurement Systems Using Targeted Verification with a Gold Standard 

      Severn, Daniel Ernest (University of Waterloo, 2017-05-19)
      Binary Measurement Systems (BMS) are used to classify objects into two categories. Sometimes the categories represent some intrinsically dichotomous characteristic of the object, but sometimes continuous or even multidimensional ...
    • Assessment and Comparison of Continuous Measurement Systems 

      Stevens, Nathaniel (University of Waterloo, 2014-12-10)
      In this thesis we critically examine the assessment and comparison of continuous measurement systems. Measurement systems, defined to be the devices, people, and protocol used to make a measurement, are an important tool ...
    • Asymptotic Estimates for Rational Spaces on Hypersurfaces in Function Fields 

      Zhao, Xiaomei (University of Waterloo, 2010-06-29)
      The ring of polynomials over a finite field has many arithmetic properties similar to those of the ring of rational integers. In this thesis, we apply the Hardy-Littlewood circle method to investigate the density of rational ...
    • Attributed Intelligence 

      Kryven, Marta (University of Waterloo, 2018-01-31)
      Human beings quickly and confidently attribute more or less intelligence to one another. What is meant by intelligence when they do so? And what are the surface features of human behaviour that determine their judgements? ...
    • Augmenting Local Search for Satisfiability 

      Southey, Finnegan (University of Waterloo, 2004)
      This dissertation explores approaches to the satisfiability problem, focusing on local search methods. The research endeavours to better understand how and why some local search methods are effective. At the root of ...
    • Automated Knowledge Discovery using Neural Networks 

      Panju, Maysum (University of Waterloo, 2021-05-21)
      The natural world is known to consistently abide by scientific laws that can be expressed concisely in mathematical terms, including differential equations. To understand the patterns that define these scientific laws, it ...
    • Automated recognition of handwritten mathematics 

      MacLean, Scott (University of Waterloo, 2014-04-17)
      Most software programs that deal with mathematical objects require input expressions to be linearized using somewhat awkward and unfamiliar string-based syntax. It is natural to desire a method for inputting mathematics ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages