Search Constraints

Start Over
Filtering by: Creator Burnham, Jeffrey S. Remove constraint Creator: Burnham, Jeffrey S. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Theory and Implementation of a Variational Database Management System

    Creator:
    Ataei, Parisa S.
    Abstract:
    In this thesis, I present the variational database management system, a formal framework and its implementation for representing variation in relational databases and managing variational information needs. A variational database is intended to support any kind of variation in a database. Specific kinds of variation in databases have already been...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Parisa S. Ataei for

  • Learning to Estimate Multi-Relation Aggregation Functions

    Creator:
    Jadhav, Rashmi Suresh
    Abstract:
    Multi-relation aggregation queries process the join operator before computing the aggregation function. This join is arguably the most costly operation since traditional join algorithms spend majority of their time trying to join the parts of the relations that do not generate any output tuples. This causes slow response times with...
    Resource Type:
    Masters Thesis
    Full Text:
    outer relation R with an inner relation S as R ./ S. The outer relation R is scanned and for each tuple

  • Decentralized Multi-Robot Exploration with Sparse Communication through Deep Imitation Learning

    Creator:
    Senewiratne, Yomal K.
    Abstract:
    We present a method for decentralized, multi-robot exploration in adverse environments where communication is minimal. A key conceptual feature of our method is enabling implicit coordination between robots by training a Convolutional Neural Network (CNN) as a heuristic for planning using Monte Carlo Tree Search (MCTS). Our method consists of...
    Resource Type:
    Masters Thesis
    Full Text:
    path pit is encoded as a 41× 41× 1 binary matrix, where the 1’s capture the paths taken. The action

  • Collaborative Online Learning For Join Processing

    Creator:
    Xie, Mian
    Abstract:
    Relational binary operators, such as join, are arguably the most costly and frequently used operations in relational data systems. In many join algorithms, the majority of the process time is spent on scanning and attempting to join the parts of the relations that do not satisfy the join condition and...
    Resource Type:
    Capstone Project
    Full Text:
    queries. . . . . . . . . . 39 LIST OF TABLES Table Page 5.1 Information on TPC-H Relations(s=1

  • Efficient Algorithms for Robust Spatiotemporal Data Analysis

    Creator:
    Moore, Travis W.
    Abstract:
    Many large-scale data analysis applications involve data that can vary over both time and space. Often the primary goal of analyzing spatiotemporal data is identifying trends, movements, and sudden changes with respect to time, location, or both. This can include a variety of applications in economics (housing prices, unemployment, job...
    Resource Type:
    Dissertation
    Full Text:
    , Max Larrivee, Jeffrey Oliver and Jeremy Kerr) and eBird (Daniel Fink, Chris Wood, and Frank La Sorte

  • Anomaly Detection and Probabilistic Diagnosis for Automated Data Quality Control

    Creator:
    Zemicheal, Tadesse H.
    Abstract:
    Advances in sensor technology are greatly expanding the range of quantities that can be measured while simultaneously reducing the cost. However, deployed sensors drift out of calibration and fail, so every sensor network requires quality control procedures to promptly detect these failures. To address these problems, we propose a two-level...
    Resource Type:
    Dissertation
    Full Text:
    distribution P (V |S) of a set of sen- sors given the states of all of the sensors and simultaneously infers

  • Network Coding, Random Matrices, and Their Applications to Communication Systems

    Creator:
    Nguyen-Huu, Duong
    Abstract:
    In this work, we study network coding technique, its relation to random matrices, and their applications to communication systems. The dissertation consists of three main contributions. First, we propose efficient algorithms for data synchronization via a broadcast channel using random network coding. Second, we study the resiliency of network coding...
    Resource Type:
    Dissertation
    Full Text:
    performance E[T (S) i ] vs. K for algorithm SRNC 43 3.6 Theoretical and empirical performance Var[T (S) i

  • A Deep Action Segmentation and Its Explanation with a Dictionary of Meaningful Attention Maps

    Creator:
    Trigkakis, Dimitrios
    Abstract:
    This thesis addresses the problem of temporal action segmentation in videos, where the goal is to label every video frame with the appropriate action class present. We focus on the domain of NFL football videos, where action classes represent common football play types. For action segmentation, we use a temporal...
    Resource Type:
    Masters Thesis

  • Efficient Incremental Panorama Reconstruction from Multiple Videos

    Creator:
    Feng, Zhongyuan
    Abstract:
    Constructing a panorama from a set of videos is a long-standing problem in computer vision. A panorama represents an enhanced still-image representation of an entire scene captured in a set of videos, where each video shows only a part of the scene. Importantly, a panorama shows only the scene background,...
    Resource Type:
    Capstone Project
    Full Text:
    parameter predefined as 0.6 in practice. 3© similarity distance s(i,j), indicating how similar H(i,j) is to

  • Fine-Grained Object Recognition Under Limited Training Data

    Creator:
    Lam, Michael Q.
    Abstract:
    This dissertation addresses object recognition in challenging settings, where distinct object classes are visually very similar (e.g., species of birds and insects) and/or access to training examples of object classes is limited (e.g., due to the associated high costs of data annotation). In this dissertation, we present a variety of...
    Resource Type:
    Dissertation
    Full Text:
    for computing the heuristic function, S-layer for realizing the successor function, and Long Short