Now showing items 1-20 of 1347

    • 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 ...
    • 2-crossing critical graphs with a V8 minor 

      Austin, Beth Ann (University of Waterloo, 2012-01-17)
      The crossing number of a graph is the minimum number of pairwise crossings of edges among all planar drawings of the graph. A graph G is k-crossing critical if it has crossing number k and any proper subgraph of G has a ...
    • 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 ...
    • 5-Choosability of Planar-plus-two-edge Graphs 

      Mahmoud, Amena (University of Waterloo, 2018-01-02)
      We prove that graphs that can be made planar by deleting two edges are 5-choosable. To arrive at this, first we prove an extension of a theorem of Thomassen. Second, we prove an extension of a theorem Postle and Thomas. ...
    • 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 ...
    • Abstract and Explicit Constructions of Jacobian Varieties 

      Urbanik, David (University of Waterloo, 2018-08-10)
      Abelian varieties, in particular Jacobian varieties, have long attracted interest in mathematics. Their influence pervades arithmetic geometry and number theory, and understanding their construction was a primary motivator ...
    • 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) ...
    • 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. ...
    • Action of degenerate Bethe operators on representations of the symmetric group 

      Rahman, Sifat (University of Waterloo, 2018-05-24)
      Degenerate Bethe operators are elements defined by explicit sums in the center of the group algebra of the symmetric group. They are useful on account of their relation to the Gelfand-Zetlin algebra and the Young-Jucys-Murphy ...
    • 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 ...
    • Acyclic Colouring of Graphs on Surfaces 

      Redlin, Shayla (University of Waterloo, 2018-09-04)
      An acyclic k-colouring of a graph G is a proper k-colouring of G with no bichromatic cycles. In 1979, Borodin proved that planar graphs are acyclically 5-colourable, an analog of the Four Colour Theorem. Kawarabayashi and ...
    • 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 ...
    • 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 Fusion Techniques for Effective Multimodal Deep Learning 

      Sahu, Gaurav (University of Waterloo, 2020-08-28)
      Effective fusion of data from multiple modalities, such as video, speech, and text, is a challenging task due to the heterogeneous nature of multimodal data. In this work, we propose fusion techniques that aim to model ...
    • Adaptive Range Counting and Other Frequency-Based Range Query Problems 

      Wilkinson, Bryan T. (University of Waterloo, 2012-05-18)
      We consider variations of range searching in which, given a query range, our goal is to compute some function based on frequencies of points that lie in the range. The most basic such computation involves counting the ...

      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