Search Constraints

Start Over
Filtering by: Creator Garcia, Michael O. Remove constraint Creator: Garcia, Michael O. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Learning MDP action models via discrete mixture trees

    Creator:
    Wynkoop, Michael S.
    Abstract:
    This thesis addresses the problem of learning dynamic Bayesian network (DBN) models to support reinforcement learning. It focuses on learning regression tree models of the conditional probability distributions of the DBNs. Existing algorithms presume that the stochasticity in the domain can be modeled as a deterministic function with additive noise....
    Resource Type:
    Masters Thesis
    Full Text:
    OF Michael S. Wynkoop for the degree of Masters of Science in Computer Science presented on June 9

  • 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:
    AN ABSTRACT OF THE DISSERTATION OF Michael Lam for the

  • A tool for visualizing sequence alignments and associating annotations

    Creator:
    Zhang, Wenpeng
    Abstract:
    Alignment of genomic sequences from different species is becoming an increasingly powerful method in biology, and is being used for many purposes. The result of sequence alignments is a list of pairs of matched locations between the pattern string and the text string. However, without any proper visualization tools to...
    Resource Type:
    Capstone Project
    Full Text:
    ( assuming the input data is presorted, otherwise in O(N log N) time). In the associating annotation part

  • 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:
    technology in my major. I would like to thank my collaborators Rashmi Jadhav and Michael Burton since I

  • 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:
    interesting. I would like to thank my collaborators Mian Xie and Michael Burton since I truly liked working

  • Part-based and Uncertainty-Aware Few-shot Object Segmentation in Images

    Creator:
    Nguyen, Khoi D.
    Abstract:
    This dissertation addresses few-shot object segmentation in images. The goal of segmentation is to label every image pixel with a class of the object occupying that pixel, where the class may represent a semantic object category or instance. In few-shot segmentation, training and test datasets have different classes. Every new...
    Resource Type:
    Dissertation
    Full Text:
    , Tieqiao Wang, Peng Lei, Dimitrios Trigkakis, Michael Lam, Anirban Roy, and Behrooz Mahasseni. I would

  • From shape-based object recognition and discovery to 3D scene interpretation

    Creator:
    Payet, Nadia
    Abstract:
    This dissertation addresses a number of inter-related and fundamental problems in computer vision. Specifically, we address object discovery, recognition, segmentation, and 3D pose estimation in images, as well as 3D scene reconstruction and scene interpretation. The key ideas behind our approaches include using shape as a basic object feature, and...
    Resource Type:
    Dissertation

  • Action Selection for Heterologous Control of a Continuous-Output Myoelectric Prosthesis

    Creator:
    Sylwester, Sean T.
    Abstract:
    Significance: Movement intent decoding algorithms can interpret human bioelectrical signals to control prosthetic limbs with many degrees of freedom (DOFs). This work involves decoding volitional movement intent from surface electromyogram (sEMG) signals to control prosthetic arms. To train these algorithms, patients flex their muscles to “follow” a movement prompt, and...
    Resource Type:
    Masters Thesis
    Full Text:
    Algorithm Complexity Scaling Algorithm Timing n,m Scaling Greedy ntg O ( n ) Second-Order tcv ( n+ 2 ( n

  • 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:
    result that the entire space of possible parser states for a sentence of length n can be reduced to O

  • Deep Learning for Human and Biological Languages

    Creator:
    Hong, Junki
    Abstract:
    We explore the application of deep learning to the disparate fields of natural language processing and computational biology. Both the sentences uttered by humans as well as the RNA and protein sequences found within the cells of their bodies can be considered formal languages in computer science, as sets of...
    Resource Type:
    Dissertation
    Full Text:
    -of-the-art accuracy. Converting the traditional O(n3) exhaustive cubic time CKY parsing algorithm