Search Constraints

Start Over
Filtering by: Creator Istok, Jonathan D. Remove constraint Creator: Istok, Jonathan D. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Visual object discovery and understanding

    Creator:
    Yuan, Jialin
    Abstract:
    Learning to recognize objects is a fundamental and essential step in human perception and understanding of the world. Accordingly, research of object discovery across diverse modalities plays a pivotal role in the context of computer vision. This field not only contributes significantly to enhancing our understanding of visual information but...
    Resource Type:
    Dissertation

  • Variational Satisfiability Solving

    Creator:
    Young, Jeffrey M.
    Abstract:
    Over the last two decades, satisfiability and satisfiability-modulo theory (SAT/SMT) solvers have grown powerful enough to be general purpose reasoning engines throughout software engineering and computer science. However, most practical use cases of SAT/SMT solvers require not just solving a single SAT/SMT problem, but solving sets of related SAT/SMT problems....
    Resource Type:
    Dissertation
    Full Text:
    parents Barbara and Jonathan Young, and my Aunt Denise Schmidt. In loving memory of Jesse M. Young and

  • UCT for tactical assault battles in real-time strategy games

    Creator:
    Balla, Radha-Krishna
    Abstract:
    We consider the problem of tactical assault planning in real-time strategy games where a team of friendly agents must launch an assault on an enemy. This problem offers many challenges including a highly dynamic and uncertain environment, multiple agents, durative actions, numeric attributes, and different optimization objectives. While the dynamics...
    Resource Type:
    Masters Thesis

  • 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:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . C Case studies: DBLP and AS . . . . . . . . . . . . . . . . . . . . . . . . . . 120 D Code

  • Structured learning with latent variables : theory and algorithms

    Creator:
    Zhao, Kai
    Abstract:
    Most tasks in natural language processing (NLP) try to map structured input (e.g., sentence or word sequence) to some form of structured output (tag sequence, parse tree, semantic graph, translated/paraphrased/compressed sentence), a problem known as “structured prediction”. While various learning algorithms such as the perceptron, maximum entropy, and expectation-maximization have...
    Resource Type:
    Dissertation
    Full Text:
    in an auditorium. Dual-attention fixes the misaligned word “auditorium”. (c) (d) Premise: A person

  • Semantic embodied navigation : developing agents that navigate from language and vision

    Creator:
    Krantz, Jacob
    Abstract:
    Autonomous robotic agents are on their way to becoming in-home personal assistants, construction assistants, and warehouse workers. The degree of autonomy of such systems is reflected by the manner in which we specify goals to them; the abstraction of low-level commands to high-level goals goes hand-in-hand with increased autonomy. In...
    Resource Type:
    Dissertation
    Full Text:
    Language Navigators From Discrete to Continuous Simulation 137 TABLE OF CONTENTS (Continued) Page D

  • Re-understanding Finite-State Representations of Recurrent Policy Networks

    Creator:
    Danesh, Mohamad H.
    Abstract:
    We propose an approach for understanding control policies represented as recurrent neural networks. Recent work has approached this problem by transforming such recurrent policy networks into finite-state machines (FSM) and then analyzing the equivalent minimized FSM. While this led to interesting insights, the minimization process can obscure a deeper understanding...
    Resource Type:
    Masters Thesis
    Full Text:
    ) is used to understand decisions in terms of observations. d) Functional pruning (Section 3.3.3

  • Optimal inference with local expressions

    Creator:
    Borujerdi, Mohammad
    Abstract:
    Probabilistic inference using Bayesian networks is now a well-established approach for reasoning under uncertainty. Among many e ciency-driven tech- niques which have been developed, the Optimal Factoring Problem (OFP) is distinguished for presenting a combinatorial optimization point of view on the problem. The contribution of this thesis is to extend...
    Resource Type:
    Dissertation
    Full Text:
    Member (Timothy Budd) Committee Member (Prasad Tadepalli) Graduate School Representative (Jonathan King

  • Object Tracking-by-Segmentation in Videos

    Creator:
    Chen, Sheng
    Abstract:
    This thesis focuses on the problem of object tracking. Given a video, the general objective of tracking is to track the location over time of one or more targets in the image sequence. This is a very challenging task as algorithms need to deal with problems such as appearance variations,...
    Resource Type:
    Dissertation
    Full Text:
    that |L(Si)| > 1 do 3: L = ConstraintPropagation(L,Σ) 4: D = {(S, l) : S ∈ A(L), l ∈ L(S)} 5: (Si, l

  • New learning modes for sequential decision making

    Creator:
    Judah, Kshitij
    Abstract:
    This thesis considers the problem in which a teacher is interested in teaching action policies to computer agents for sequential decision making. The vast majority of policy learning algorithms o er teachers little flexibility in how policies are taught. In particular, one of two learning modes is typically considered: 1)...
    Resource Type:
    Dissertation
    Full Text:
    on (a) Cart- pole (b) Bicycle balancing (c) Wargus (d) Driving Domain. . . . . . . . . 80 4.4