Now showing items 1-20 of 1544

    • A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings 

      Demontigny, Philippe (University of Waterloo, 2016-08-18)
      In this thesis, we study drawings of maximal outerplanar graphs that place vertices on integer coordinates. We introduce a new class of graphs, called umbrellas, and a new method of splitting maximal outerplanar graphs ...
    • 3-D Reconstruction from Single Projections, with Applications to Astronomical Images 

      Cormier, Michael (University of Waterloo, 2013-08-23)
      A variety of techniques exist for three-dimensional reconstruction when multiple views are available, but less attention has been given to reconstruction when only a single view is available. Such a situation is normal in ...
    • 3D Online Multi-Object Tracking for Autonomous Driving 

      Balasubramanian, Venkateshwaran (University of Waterloo, 2019-08-29)
      This research work focuses on exploring a novel 3D multi-object tracking architecture: 'FANTrack: 3D Multi-Object Tracking with Feature Association Network' for autonomous driving, based on tracking by detection and online ...
    • 3D Pointing with Everyday Devices: Speed, Occlusion, Fatigue 

      Pietroszek, Krzysztof (University of Waterloo, 2015-07-24)
      In recent years, display technology has evolved to the point where displays can be both non-stereoscopic and stereoscopic, and 3D environments can be rendered realistically on many types of displays. From movie theatres ...
    • 5G RAN/MEC Slicing and Admission Control using Deep Reinforcement Learning 

      Moayyedi, Arash (University of Waterloo, 2023-01-19)
      The 5G RAN functions can be virtualized and distributed across the radio unit (RU), distributed unit (DU), and centralized unit (CU) to facilitate flexible resource management. Complemented by multi-access edge computing ...
    • A+ Indexes: Highly Flexible Adjacency Lists in Graph Database Management Systems 

      Khaliq, Shahid (University of Waterloo, 2019-09-17)
      Adjacency lists are the most fundamental storage structure in existing graph database management systems (GDBMSs) to index input graphs. Adjacency lists are universally linked-list like per-vertex structures that allow ...
    • Accelerating and Privatizing Diffusion Models 

      Dockhorn, Tim (University of Waterloo, 2023-08-17)
      Diffusion models (DMs) have emerged as a powerful class of generative models. DMs offer both state-of-the-art synthesis quality and sample diversity in combination with a robust and scalable learning objective. DMs rely ...
    • Accelerating the Training of Convolutional Neural Networks for Image Segmentation with Deep Active Learning 

      Chen, Wei Tao (University of Waterloo, 2020-01-23)
      Image semantic segmentation is an important problem in computer vision. However, Training a deep neural network for semantic segmentation in supervised learning requires expensive manual labeling. Active learning (AL) ...
    • Access Control Administration with Adjustable Decentralization 

      Chinaei, Amir Hossein (University of Waterloo, 2007-09-12)
      Access control is a key function of enterprises that preserve and propagate massive data. Access control enforcement and administration are two major components of the system. On one hand, enterprises are responsible for ...
    • Accurate viscous free surfaces for buckling, coiling, and rotating liquids 

      Batty, Christopher; Bridson, Robert (Association for Computing Machinery, 2008-07)
      We present a fully implicit Eulerian technique for simulating free surface viscous liquids which eliminates artifacts in previous approaches, efficiently supports variable viscosity, and allows the simulation of more ...
    • Achieving Performance Objectives for Database Workloads 

      Mallampalli, Anusha (University of Waterloo, 2010-08-30)
      In this thesis, our goal is to achieve customer-specified performance objectives for workloads in a database management system (DBMS). Competing workloads in current DBMSs have detrimental effects on performance. ...
    • Active Learning with Semi-Supervised Support Vector Machines 

      Chinaei, Leila (University of Waterloo, 2007-05-22)
      A significant problem in many machine learning tasks is that it is time consuming and costly to gather the necessary labeled data for training the learning algorithm to a reasonable level of performance. In reality, it is ...
    • Active Sensing for Partially Observable Markov Decision Processes 

      Koltunova, Veronika (University of Waterloo, 2013-01-21)
      Context information on a smart phone can be used to tailor applications for specific situations (e.g. provide tailored routing advice based on location, gas prices and traffic). However, typical context-aware smart phone ...
    • Ad-hoc Holistic Ranking Aggregation 

      Saleeb, Mina (University of Waterloo, 2012-12-06)
      Data exploration is considered one of the major processes that enables the user to analyze massive amount of data in order to find the most important and relevant informa- tion needed. Aggregation and Ranking are two of ...
    • Adapting Component Analysis 

      Dorri, Fatemeh (University of Waterloo, 2012-05-18)
      A main problem in machine learning is to predict the response variables of a test set given the training data and its corresponding response variables. A predictive model can perform satisfactorily only if the training ...
    • Adapting to Data Drift in Encrypted Traffic Classification Using Deep Learning 

      Malekghaini, Navid (University of Waterloo, 2023-01-12)
      Deep learning models have shown to achieve high performance in encrypted traffic classification. However, when it comes to production use, multiple factors challenge the performance of these models. The emergence of new ...
    • Adaptive Algorithms for Weighted Queries on Weighted Binary Relations and Labeled Trees 

      Veraskouski, Aleh (University of Waterloo, 2007-07-30)
      Keyword queries are extremely easy for a user to write. They have become a standard way to query for information in web search engines and most other information retrieval systems whose users are usually laypersons and ...
    • Adaptive Comparison-Based Algorithms for Evaluating Set Queries 

      Mirzazadeh, Mehdi (University of Waterloo, 2004)
      In this thesis we study a problem that arises in answering boolean queries submitted to a search engine. Usually a search engine stores the set of IDs of documents containing each word in a pre-computed sorted order and ...
    • An Adaptive Context-Aware Publish–Subscribe Component Metamodel 

      Blanco, Luis (University of Waterloo, 2015-01-16)
      There are plenty of solutions in which the functionality for context awareness is separated from the domain-specific functionality. Also, there are multiple ways of modeling, gathering, and processing context-related ...
    • Adaptive CPU Allocation for Resource Isolation and Work Conservation 

      Guo, Cong (University of Waterloo, 2020-07-06)
      Consolidating multiple workloads on the same physical machine is an effective measure for utilizing resources efficiently and reducing costs. The main objective is to execute multiple demanding workloads using no more than ...

      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