Search Constraints

Start Over
Filtering by: Creator Hoover, Ronald D. Remove constraint Creator: Hoover, Ronald D. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Behavior graphs for data-driven animation of 3d characters

    Creator:
    Srinivasan, Madhusudhanan
    Abstract:
    In this dissertation, we present a user-in-the-loop method for the design of an interactive motion data structure that benefits from the advantages of both motion graphs and blend-based techniques. Our novel approach automatically analyzes a traditional motion graph built from labeled motion clips. The result is a more condensed, coarser...
    Resource Type:
    Dissertation
    Full Text:
    : Behavior Graphs for Data-driven Animation of 3D Characters Abstract approved: Ronald A. Metoyer In this

  • Applying hierarchical and adaptive control to coordinating simple robots

    Creator:
    Knudson, Matthew D.
    Abstract:
    Coordinating multiple robots to achieve a complex task requires solving two distinct control problems: the high-level control problem of ensuring that each robot aims to perform a useful task (e.g., coordination) and the low-level control problem of ensuring that each robot actually performs the correct actions to achieve its task...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Matthew D. Knudson for the

  • Navigation and coordination of autonomous mobile robots with limited resources

    Creator:
    Knudson, Matthew D.
    Abstract:
    The use of autonomous robots in complex exploration tasks is rapidly increasing. Indeed, robots can provide speed and cost effectiveness in many tasks, as well as allow operation in environments that are hostile to humans. In this dissertation we: 1) provide two adaptive navigation algorithms; 2) develop a coordination mechanism;...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Matthew D. Knudson for

  • Domain-Independent Planning for Markov Decision Processes with Factored State and Action Spaces

    Creator:
    Raghavan, Aswin
    Abstract:
    Markov Decision Processes (MDPs) are the de-facto formalism for studying sequential decision making problems with uncertainty, ranging from classical problems such as inventory control and path planning, to more complex problems such as reservoir control under rainfall uncertainty and emergency response optimization for fire and medical emergencies. Most prior research...
    Resource Type:
    Dissertation
    Full Text:
    - cured in Corvalllis. I am also thankful to Ronald Bjarnason for making his code available from his

  • 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
    Full Text:
    Diversity . . . . . . . . . . . . . . . . 33 4.3.3 1-D Regression

  • Robust and Efficient Classification of Videos in the Wild

    Creator:
    Mahasseni, Behrooz
    Abstract:
    Recognizing human actions in videos is a long-standing problem in computer vision with a wide range of applications including video surveillance, content retrieval, and sports analysis. This thesis focuses on addressing efficiency and robustness of video classification in unconstrained real-world settings. The thesis work can be broadly divided into four...
    Resource Type:
    Dissertation
    Full Text:
    Qualcomm Corp R&D. I am also grateful to my good friends and colleagues, in university and my internships

  • Principles of Variational Databases

    Creator:
    Ataei, Parisa S.
    Abstract:
    Data variations are prevalent in real-world applications. For example, software vendors have to handle numerous variations in the business requirements, conventions, and environmental settings of a software product. In database-backed software, the database of each version may have a different schema and content. As another example, data scientists often need...
    Resource Type:
    Masters Thesis
    Full Text:
    contains. Let D be a countably infinite set of constants. An instance IS of S assigns to each relation

  • 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:
    is observed from position d−1 to 20 position d in the sequence Y and 0 otherwise, and where P (yd

  • Representationally Robust and Scalable Learning over Relational Databases

    Creator:
    Picado Leiva, Jose Manuel
    Abstract:
    Learning novel concepts from relational databases is an important problem with applications in several disciplines, such as data management, natural language processing, and bioinformatics. For a learning algorithm to be effective, the input data should be clean and in some desired representation. However, real-world data is usually heterogeneous – the...
    Resource Type:
    Dissertation
    Full Text:
    symbol R is associated with a set of attribute symbols denoted as sort(R). Let D be a countably infinite

  • 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:
    explanation space to be orthogonal; (c) The log penalty function log(1 + q · r2) when q = 1; (d) The log