Search Constraints

Start Over
Filtering by: Creator Billman, Eric J. Remove constraint Creator: Billman, Eric J. Academic Affiliation Electrical Engineering and Computer Science Remove constraint Academic Affiliation: Electrical Engineering and Computer Science Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • 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:
    : Variational Satisfiability Solving Abstract approved: Eric Walkingshaw Over the last two decades

  • Object highlighting : real-time boundary detection using a Bayesian network

    Creator:
    Jia, Jin
    Abstract:
    Image segmentation continues to be a fundamental problem in computer vision and image understanding. In this thesis, we present a Bayesian network that we use for object boundary detection in which the MPE (most probable explanation) before any evidence can produce multiple non-overlapping, non-self-intersecting closed contours and the MPE with...
    Resource Type:
    Masters Thesis
    Full Text:
    Boundary Detection using a Bayesian Network. Abstract Eric Mortensen image segmentation continues to be

  • Image feature detection and matching for biological object recognition

    Creator:
    Deng, Hongli
    Abstract:
    Image feature detection and matching are two critical processes for many computer vision tasks. Currently, intensity-based local interest region detectors and local feature-based matching methods are used widely in computer vision applications. But in some applications, such as biological object recognition tasks, within-class changes in pose, lighting, color, and texture...
    Resource Type:
    Dissertation
    Full Text:
    : Image Feature Detection and Matching for Biological Object Recognition Abstract approved: Eric

  • An Empirical Evaluation of Policy Rollout for Clue

    Creator:
    Marshall, Eric
    Abstract:
    We model the popular board game of Clue as an MDP and evaluate Monte-Carlo policy rollout in a simulated environment pitting different agents and policies against each other. We describe the choices we made in the representation, along with some of the problems we encountered along the way. We find...
    Resource Type:
    Capstone Project
    Full Text:
    An Empirical Evaluation of Policy Rollout for Clue® Eric Marshall Oregon State University M.S

  • Using Change Representations to Analyze Properties of Variational Software

    Creator:
    Wang, Xiangyu
    Abstract:
    Appropriate representations of variational software simplify the analysis of their properties.This thesis proposes tailored representations of two kinds variational softwares: difference files of merge commits in Git and feature models. For the former, we use the Choice Edit Model, which is based on the choice calculus, to represent changes introduced...
    Resource Type:
    Masters Thesis

  • Improving the Effectiveness of Answering Keyword Queries Using Effective Subsets

    Creator:
    Khodadadi, Abtin
    Abstract:
    Most database users do not know formal query languages, such as SQL, and prefer to express their information needs using usable query languages, such as keyword queries. Keyword queries, however, are inherently ambiguous and challenging for the database systems to understand and answer effectively. We propose a novel approach to...
    Resource Type:
    Capstone Project
    Full Text:
    , Josiane Mothe, Michael Preminger, Eric SanJuan, Ralf Schenkel, Mette Skov, Xavier Tannier, and David Walsh

  • Variational Typing and Its Applications

    Creator:
    Chen, Sheng
    Abstract:
    The study of variational typing originated from the problem of type inference for variational programs, which encode numerous different but related plain programs. In this dissertation, I present a sound and complete type inference algorithm for inferring types of all plain programs encoded in variational programs. The proposed algorithm runs...
    Resource Type:
    Dissertation
    Full Text:
    her life with me. During my study at Oregon State University, I worked closely with Eric Walk­

  • Multiagent learning for locomotion and coordination in tensegrity robotics

    Creator:
    Iscen, Atil
    Abstract:
    Tensegrity structures are composed of pure compressional elements that are connected via a network of pure tensional elements. The concept of tensegrity promises numerous advantages to the field of robotics. Tensegrity robots are, however, notoriously difficult to control due to their oscillatory nature and nonlinear interaction between the components. Multiagent...
    Resource Type:
    Dissertation
    Full Text:
    reward function. We take a snapshot of the environment (z), feed the reward function with z and z−j

  • Image features and learning algorithms for biological, generic and social object recognition

    Creator:
    Zhang, Wei
    Abstract:
    Automated recognition of object categories in images is a critical step for many real-world computer vision applications. Interest region detectors and region descriptors have been widely employed to tackle the variability of objects in pose, scale, lighting, texture, color, and so on. Different types of object recognition problems usually require...
    Resource Type:
    Dissertation
    Full Text:
    guidance have provided the best basis for this dissertation. I am pleased to thank Professor Eric

  • Analytical Methods for Improving Causal Inference

    Creator:
    Sinha, Meghamala
    Abstract:
    Causal inference is an important analytical tool to bridge the gap between prediction and decision-making. However, learning a causal network solely from data is a challenging task. In this work, various techniques have been explored for a better and improved causal network learning from data. Firstly, the problem of learning...
    Resource Type:
    Dissertation
    Full Text:
    distribution of p after intervention is: p(V1, ..., Vn) = ∏ Vi∈Oe pi(Vi | Pa(Vi)) · ∏ Vj∈Ie p′j(Vj | Pa(Vj