Search Constraints

Start Over
Filtering by: Creator Mroczek, Daniel K. Remove constraint Creator: Mroczek, Daniel K. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • 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

  • Bayesian optimization with empirical constraints

    Creator:
    Azimi, Javad
    Abstract:
    Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are...
    Resource Type:
    Dissertation
    Full Text:
    select k ≥ 1 points to be evaluated. The results of those points are then added to the set of

  • Statistical Properties and Guarantees for Certain Anomaly Detection Relevant Problems

    Creator:
    Liu, Si
    Abstract:
    Anomaly detection aims at detecting the points that appear different than the majority of the data, such that they are suspected to be generated from a different distribution. Anomaly detectors have been applied in many different fields, such as detecting fraudulent behaviors in bank transaction, finding broken sensors in a...
    Resource Type:
    Dissertation
    Full Text:
    detector iForest, for the purpose of outputting the top k most anomalous points as early as possible. The

  • 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:
    Coding example . . . . . . . . . . . 12 3.1 Empirical P[K > k] vs. N

  • 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:
    feature is viEi, the product of the weight of the x-feature in the approxi- mation of ŷ(k) timed by the

  • Machine learning for improving the quality of citizen science data

    Creator:
    Yu, Jun
    Abstract:
    Citizen Science is a paradigm in which volunteers from the general public participate in scientific studies, often by performing data collection. This paradigm is especially useful if the scope of the study is too broad to be performed by a limited number of trained scientists. Although citizen scientists can contribute...
    Resource Type:
    Dissertation
    Full Text:
    distribution of Western Meadowlark across the western United States in June 2009. We thank Daniel Fink for

  • Efficient training and feature induction in sequential supervised learning

    Creator:
    Hao, Guohua
    Abstract:
    Sequential supervised learning problems arise in many real applications. This dissertation focuses on two important research directions in sequential supervised learning: efficient training and feature induction. In the direction of efficient training, we study the training of conditional random fields (CRFs), which provide a flexible and powerful model for sequential...
    Resource Type:
    Dissertation
    Full Text:
    time complexity of these algo- rithms is O(T · Lk+1), where L is the number of class labels, k is the

  • Activity recognition in desktop environments

    Creator:
    Shen, Jianqiang
    Abstract:
    Knowledge workers are struggling in the information flood. There is a growing interest in intelligent desktop environments that help knowledge workers organize their daily life. Intelligent desktop environments allow the desktop user to define a set of “activities” that characterize the user’s desktop work. These environments then attempt to identify...
    Resource Type:
    Dissertation
    Full Text:
    TaskPredictor for FA as a function of the number of selected features K. Error bars denote 95% confidence

  • 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:
    Online K-Means Clustering . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 4 Problem Statement

  • The density signature

    Creator:
    Migler-VonDollen, Theresa
    Abstract:
    In real networks, identifying dense regions is of great importance. For example, in a network that represents academic collaboration, authors within the densest component of the graph tend to be the most prolific. Dense subgraphs often identify communities in social networks. And dense subgraphs can be used to discover regulatory...
    Resource Type:
    Dissertation
    Full Text:
    value of k and £ . . . . . . . . . . . 74 7.2.3 Properties of the top core