Search Constraints

Start Over
Filtering by: Creator Matzat, James H. Remove constraint Creator: Matzat, James H. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Parsing with Recurrent Neural Networks

    Creator:
    Cross, James Henry, III
    Abstract:
    Machine learning models for natural language processing have traditionally relied on large numbers of discrete features, built up from atomic categories such as word forms and part-of-speech labels, which are considered completely distinct from each other. Recently however, the advent of dense feature representations coupled with deep learning techniques has...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF James Henry Cross III for

  • 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:
    AN ABSTRACT OF THE DISSERTATION OF Tadesse H. Zemicheal

  • Rare category detection using hierarchical mean shift

    Creator:
    Vatturi, Pavan Kumar
    Abstract:
    Many applications in surveillance, monitoring, scientific discovery, and data cleaning require the identification of anomalies. Although many methods have been developed to identify statistically significant anomalies, a more difficult task is to identify anomalies that are both interesting and statistically significant. Category detection is an emerging area of machine learning...
    Resource Type:
    Masters Thesis
    Full Text:
    point x is given by f̂(x) = n−1 n∑ i=1 KH(x− xi) (3.1) where KH(x− xi) = |H|−1/2K(H−1/2x) (3.2) H

  • Customizable Visual Traces for Program Explanations

    Creator:
    Bajaj, Divya
    Abstract:
    Correctness and efficiency are important properties of programs. However, to support maintenance and debugging, the programs should also be understandable. Program explanations also play a vital role in educational settings, enhancing the understanding of programs among students. Proof trees provide a sound basis for generating dynamic explanations of programs. But...
    Resource Type:
    Masters Thesis
    Full Text:
    5.4 Hiding leaf node h in trace for sqr 5 (cf. Figure 4.9). . . . . . . . . . . . . 31 5.5 Applying

  • 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:
    grounded by the Convolutional Neural Network (CNN) to an image and consists of three components: H-layer

  • 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:
    +H23 (3.3) Re-writing the above equations,3 axh = 0 ayh = 0 h = (h1,h2,h3)T (3.4) 2We use

  • Uncertainty in Deep Learning with Implicit Neural Networks

    Creator:
    Ratzlaff, Neale
    Abstract:
    The ability to extract uncertainties from predictions is crucial for the adoption of deep learning systems to safety-critical applications. Uncertainty estimates can be used as a failure signal, which is necessary for automating complex tasks where safety is a concern. Furthermore, current deep learning systems do not provide uncertainty estimates,...
    Resource Type:
    Dissertation

  • 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:
    ] . . . . . . . . . . . . . . . . 4 2.2 Block Nested Loop Join Algorithm from [27] . . . . . . . . . . . . . 5 5.1 The TPC-H Schema

  • Toward Disentangling the Activations of the Deep Networks via Low-dimensional Embedding and Non-negative Factorization

    Creator:
    Khorram, Saeed
    Abstract:
    In this thesis, we introduce a novel Explanation Neural Network (XNN) to explain the predictions made by a deep network. The XNN works by embedding a high-dimensional activation vector of a deep network layer non-linearly into a low-dimensional explanation space while retaining faithfulness i.e., the original deep learning predictions can...
    Resource Type:
    Masters Thesis
    Full Text:
    place (front). Here, Heatmaps (H) 1-5&7 are toggled on and Heatmap (H) 6 is toggled off

  • 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:
    . . . . . . . . . . . . . . . . 81 5.10 Average optimal value versus k (rank of topology matrix H) . . . . . . . . 85 5.11 Average