Search Constraints

Start Over
Filtering by: Creator Palo, D. Remove constraint Creator: Palo, D. Academic Affiliation Computer Science Remove constraint Academic Affiliation: Computer Science

Search Results

  • Algorithms for string matching with applications in molecular biology

    Creator:
    Holloway, James Lee
    Abstract:
    As the volume of genetic sequence data increases due to improved sequencing techniques and increased interest, the computational tools available to analyze the data are becoming inadequate. This thesis seeks to improve a few of the computational methods available to access and analyze data in the genetic sequence databases. The...
    Resource Type:
    Dissertation
    Full Text:
    edit distance between two satellite DNA sequences from D. melanogaster using the parallel dynamic

  • LacEDAemon : a programming environment for the multiparadigm language leda

    Creator:
    Pandey, Rajeev K.
    Abstract:
    Multiparadigm programming languages are a recent development in the realm of programming languages. A multiparadigm programming language allows the use of multiple, differing programming paradigms without departing from a single, unified linguistic framework. Multiparadigm programming languages are claimed to have benefits to both pedagogy and complex application creation. The beneficial...
    Resource Type:
    Dissertation
    Full Text:
    environment might be spartan. As a result, the environment name was changed to Lacedaemon (las-e-d�e�mon

  • Pattern systems and methodologies for multiparadigm analysis and design

    Creator:
    Knutson, Charles D.
    Abstract:
    In this research, we have captured, in pattern form, key elements of programming and design in four programming paradigms (imperative, object-oriented, functional and logical) as well as multiparadigm programming. These pattern sets have formed a foundation upon which we were able to build a deeper understanding of multiparadigm programming and...
    Resource Type:
    Dissertation
    Full Text:
    DISSERTATION OF Charles D. Knutson for the degree of Doctor of Philosophy in Computer Science presented on

  • Methods for cost-sensitive learning

    Creator:
    Margineantu, Dragos D.
    Abstract:
    Many approaches for achieving intelligent behavior of automated (computer) systems involve components that learn from past experience. This dissertation studies computational methods for learning from examples, for classification and for decision making, when the decisions have different non-zero costs associated with them. Many practical applications of learning algorithms, including transaction...
    Resource Type:
    Dissertation
    Full Text:
    be rigorous. He has been very influential in my thinking. I owe special debts to Bruce D' Ambrosio

  • An alternative architecture for performing basic computer arithmetical operations

    Creator:
    Djang, Kevin
    Abstract:
    The arithmetic portions of almost all modern processor architectures are of very similar design. We use the term "traditional" to describe this design, the primary characteristics of which are native support for integer and floating-point number types and special disjoint instructions and hardware for each supported type. Decades of refinement...
    Resource Type:
    Masters Thesis

  • Just enough die-level functional test : optimizing IC test via machine learning and decision theory

    Creator:
    Fountain, Tony R.
    Abstract:
    This research explores the hypothesis that methods from decision theory and machine learning can be combined to provide practical solutions to current manufacturing control problems. This hypothesis is explored by developing an integrated approach to solving one manufacturing problem - the optimization of die-level functional test. An integrated circuit (IC)...
    Resource Type:
    Dissertation

  • Representations and algorithms for efficient inference in Bayesian networks

    Creator:
    Takikawa, Masami
    Abstract:
    Bayesian networks are used for building intelligent agents that act under uncertainty. They are a compact representation of agents' probabilistic knowledge. A Bayesian network can be viewed as representing a factorization of a full joint probability distribution into the multiplication of a set of conditional probability distributions. Independence of causal...
    Resource Type:
    Dissertation
    Full Text:
    network in figure 1.1, the joint proba­ bility of nodes D and E, P(D, E), can be computed in several ways

  • Generalizing abstractions in form-based visual programming languages : from direct manipulation to static representation

    Creator:
    Yang, Sherry
    Abstract:
    We believe concreteness, direct manipulation and responsiveness in a visual programming language increase its usefulness. However, these characteristics present a challenge in generalizing programs for reuse, especially when concrete examples are used as one way of achieving concreteness. In this thesis, we present a technique to solve this problem by...
    Resource Type:
    Dissertation

  • Topics in toroidal interconnection networks

    Creator:
    Broeg, Robert Richard
    Resource Type:
    Dissertation
    Full Text:
    surface area of a sphere of radius d are derived, and methods of decomposing a Qkr, into n disjoint

  • Constructive induction for improved learning of boolean functions

    Creator:
    Drake, Peter (Peter Dudey), 1970-
    Abstract:
    Supervised learning programs, such as decision tree learners and neural networks, often must learn Boolean functions. The concept being learned may not easily be expressed in terms of the atomic features given. Constructive induction automatically produces higher level features (combinations of the atomic features), which can improve learning performance. The...
    Resource Type:
    Masters Thesis
    Full Text:
    spurious feature D which is true for half of the cases. One approach to dealing with feature interaction