Search Constraints

Start Over
Filtering by: Creator Blakemore, Paul R. Remove constraint Creator: Blakemore, Paul R. Advisor Cull, Paul Remove constraint Advisor: Cull, Paul Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • A laboratory station timetable problem

    Creator:
    Mickelsen, Thomas E.
    Abstract:
    The general problem of classroom scheduling is well known to be NP-complete. A typical classroom scheduling problem is that of assigning students to a limited number of pieces of laboratory equipment. Frequently several identical pieces of equipment are available only at fixed hours and have limited access due to physical...
    Resource Type:
    Capstone Project
    Full Text:
    : Paul Cull, Associate Professor Department of Computer Science in charge of major ~ R., ~ Curtis R

  • Exact learning of tree patterns

    Creator:
    Amoth, Thomas R.
    Abstract:
    Tree patterns are natural candidates for representing rules and hypotheses in many tasks such as information extraction and symbolic mathematics. A tree pattern is a tree with labeled nodes where some of the leaves may be labeled with variables, whereas a tree instance has no variables. A tree pattern matches...
    Resource Type:
    Dissertation

  • Drawing graphs nicely

    Creator:
    Palmer, Paul A.
    Abstract:
    A graph may he drawn in many different ways. We investigate how to draw a graph nicely, in the sense of being visually pleasing. We discuss the history of this field, and look at several algorithms for drawing graphs. For planar graphs this problem has been algorithmically solved: that is,...
    Resource Type:
    Masters Thesis
    Full Text:
    Commencement June 199 7 Nlaster of Science thesis of Paul A. Palmer presented on April 21. 1995 \ PP R

  • Description and comments on a matrix algebraic method for the determination of isomorphism in pairs of undirected graphs

    Creator:
    Fogg, Ka-Hung
    Abstract:
    This paper describes an investigation of a matrix algebraic method to determine isomorphism in pairs of undirected graphs. The method is described in some detail. The theoretical as well as the practical difficulties are given. It is shown that the method works for some cases. When the adjacency matrix of...
    Resource Type:
    Capstone Project
    Full Text:
    May, 1978 Revised, June 8,1978 ) APPROVED: CL( Paul Cull, Associate Professor Department

  • A library for doing polyhedral operations

    Creator:
    Wilde, Doran K.
    Abstract:
    Polyhedra are geometric representations of linear systems of equations and inequalities. Since polyhedra are used to represent the iteration domains of nested loop programs, procedures for operating on polyhedra can be used for doing loop transformations and other program restructuring transformations which are needed in parallelizing compilers. Thus a need...
    Resource Type:
    Masters Thesis
    Full Text:
    December 6, 1993 Title: A Library for Doing Polyhedral Operations Abstract approved. Dr. Paul Cull

  • An algebraic view of the symmetry of fast transforms

    Creator:
    Ruby, Glenn Russell
    Abstract:
    Why are the fast Fourier transform and the fast Hadamard transform fast? A transform can be computed by multiplying a matrix times a vector, which normally requires 0(n²) operations. The matrices corresponding to these transforms can be rearranged to eliminate redundant computations resulting in O(nlogn) operations. We investigate algebraic reasons...
    Resource Type:
    Masters Thesis
    Full Text:
    : Redacted for Privacy Dr!' Paul Cull Why are the fast Fourier transform and the fast Hadamard transform

  • The "Mobius Cube" : an interconnection network for parallel computation

    Creator:
    Larson, Shawn M.
    Resource Type:
    Masters Thesis
    Full Text:
    have a diameter of r(n+2)/21 and Rn+1)/21 respectively, for n > 4, roughly half the diameter of the

  • The FLEX/REFLEX paradigm and its application to computer program systems

    Creator:
    Colby, Jonathan Axford
    Abstract:
    The FLEX/REFLEX paradigm is applied to the description of a computer program system. The paradigm is shown to be relevant and appropriate to computer program systems and to advantageously display and structure the general hierarchical characteristics of computer program systems. Program systems characterized in the paradigm are described both holistically...
    Resource Type:
    Masters Thesis
    Full Text:
    and Its Application to Computer Program Systems Abstract approved: Redacted for Privacy Paul Cull

  • Probabilistic computation in stochastic pulse neuromime networks

    Creator:
    Hangartner, Ricky Dale
    Resource Type:
    Dissertation
    Full Text:
    Neuromime Networks Abstract approved- Paul Cull. Biological neural networks embody a unique combination

  • Knots : a measure of program complexity

    Creator:
    McAlister, Richard Earl
    Abstract:
    Most measures of program complexity gauge either textual or control flow attributes of a program. A recent addition to the field of complexity measures, the knot metric, is a function of both these attributes. A knot measurement reflects the degree of control-flow tangle in a program's listing. This thesis discusses...
    Resource Type:
    Masters Thesis
    Full Text:
    of Program Complexity Abstract approved: Redacted for Privacy Dr. Paul Cull Most measures of