Now showing items 993-1012 of 1551

    • Optimal Portfolio Execution Strategies: Uncertainty and Robustness 

      Moazeni, Somayeh (University of Waterloo, 2011-10-28)
      Optimal investment decisions often rely on assumptions about the models and their associated parameter values. Therefore, it is essential to assess suitability of these assumptions and to understand sensitivity of outcomes ...
    • Optimal Portfolio Selection Under the Estimation Risk in Mean Return 

      Zhu, Lei (University of Waterloo, 2008-01-17)
      This thesis investigates robust techniques for mean-variance (MV) portfolio optimization problems under the estimation risk in mean return. We evaluate the performance of the optimal portfolios generated by the min-max ...
    • Optimal Success Bounds for Single Query Quantum Algorithms Computing the General SUM Problem 

      Valtchev, Alexander (University of Waterloo, 2015-05-27)
      In this thesis the problem of computing the sum of a string of arbitrary finite length drawn from an arbitrary finite alphabet is treated. The resource considered is the number of queries to some oracle which hides the ...
    • Optimization for Image Segmentation 

      Tang, Meng (University of Waterloo, 2019-06-26)
      Image segmentation, i.e., assigning each pixel a discrete label, is an essential task in computer vision with lots of applications. Major techniques for segmentation include for example Markov Random Field (MRF), Kernel ...
    • Optimization Methods for Semi-Supervised Learning 

      Cheung, Edward (University of Waterloo, 2018-05-17)
      The goal of this thesis is to provide efficient optimization algorithms for some semi-supervised learning (SSL) tasks in machine learning. For many machine learning tasks, training a classifier requires a large amount of ...
    • Optimizing Differential Computation for Large-Scale Graph Processing 

      Sahu, Siddhartha (University of Waterloo, 2024-04-01)
      Diverse applications spanning areas such as fraud detection, risk assessment, recommendations, and telecommunications process datasets characterized by entities and their relationships. Graphs naturally emerge as the most ...
    • Optimizing Hierarchical Storage Management For Database System 

      Liu, Xin (University of Waterloo, 2014-06-17)
      Caching is a classical but effective way to improve system performance. To improve system performance, servers, such as database servers and storage servers, contain significant amounts of memory that act as a fast ...
    • Optimizing MPI Collective Operations for Cloud Deployments 

      AlSader, Zuhair (University of Waterloo, 2020-01-24)
      Cloud infrastructures are increasingly being adopted as a platform for high performance computing (HPC) science and engineering applications. For HPC applications, the Message-Passing Interface (MPI) is widely-used. Among ...
    • Option Pricing under Regime Switching (Analytical, PDE, and FFT Methods) 

      Akhavein Sohrabi, Mohammad Yousef (University of Waterloo, 2011-05-19)
      Although globally used in option pricing, the Black-Scholes model has not been able to reflect the evolution of stocks in the real world. A regime-switching model which allows jumps in the underlying asset prices and the ...
    • An Ordered Bag Semantics for SQL 

      Chinaei, Hamid R. (University of Waterloo, 2007-05-22)
      Semantic query optimization is an important issue in many contexts of databases including information integration, view maintenance and data warehousing and can substantially improve performance, especially in today's ...
    • Ordered Interval Routing Schemes 

      Ahmed, Mustaq (University of Waterloo, 2004)
      An <i>Interval Routing Scheme (IRS)</i> represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint ...
    • Ordering, Indexing, and Searching Semantic Data: A Terminology Aware Index Structure 

      Pound, Jeffrey (University of Waterloo, 2008-05-16)
      Indexing data for efficient search capabilities is a core problem in many domains of computer science. As applications centered around semantic data sources become more common, the need for more sophisticated indexing ...
    • The Ordinal Serial Encoding Model: Serial Memory in Spiking Neurons 

      Choo, Feng-Xuan (University of Waterloo, 2010-08-26)
      In a world dominated by temporal order, memory capable of processing, encoding and subsequently recalling ordered information is very important. Over the decades this memory, known as serial memory, has been extensively ...
    • Outsourced Private Information Retrieval with Pricing and Access Control 

      Huang, Yizhou (University of Waterloo, 2013-05-24)
      We propose a scheme for outsourcing Private Information Retrieval (PIR) to untrusted servers while protecting the privacy of the database owner as well as that of the database clients. We observe that by layering PIR on ...
    • Overlap-Free Words and Generalizations 

      Rampersad, Narad (University of Waterloo, 2007-11-15)
      The study of combinatorics on words dates back at least to the beginning of the 20th century and the work of Axel Thue. Thue was the first to give an example of an infinite word over a three letter alphabet that contains ...
    • Ownership Masks, Evolving Views and Cooperative Templates in Template Tracking 

      Angold, Alan (University of Waterloo, 2003)
      A template tracker is a tracker based on matching a pre-initialised view of an object with the object's view in an image sequence. Using an error function, the intensity difference between the template view and the ...
    • A PAC-Theory of Clustering with Advice 

      Zokaei Ashtiani, Mohammad (University of Waterloo, 2018-05-17)
      In the absence of domain knowledge, clustering is usually an under-specified task. For any clustering application, one can choose among a variety of different clustering algorithms, along with different preprocessing ...
    • Packing Unit Disks 

      Lafreniere, Benjamin J. (University of Waterloo, 2008-08-27)
      Given a set of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks? Richard Rado conjectured 1/4 and proved 1/4.41. In this thesis, we consider ...
    • The Pair Cache Problem 

      Khodaee, SayedMohammadAmin (University of Waterloo, 2023-09-25)
      This thesis investigates the pair cache problem, a unique variation of the classic cache replacement problem where each element is stored in two pages, and the cache only needs one of these pages to respond to a query. The ...
    • Parallel Paths Analysis Using Function Call Graphs 

      Naeimian, Arman (University of Waterloo, 2019-09-23)
      Call graphs have been used widely in different software engineering areas. Since call graphs provide us with detailed information about the structure of software elements and components and how they are connected with each ...

      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