mirage

Browsing Technical Reports (Electrical Engineering and Computer Science) by Author "Cull, Paul, 1943-"

DSpace/Manakin Repository

Browsing Technical Reports (Electrical Engineering and Computer Science) by Author "Cull, Paul, 1943-"

Sort by: Order: Results:

  • Calypso : a visual language for data structures programming 
    Wodti, Richard; Cull, Paul, 1943-; Oregon State University. Dept. of Computer Science. (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1997-07)
    Data structures are more easily understood when they are presented visually rather than textually. We have developed a system, Calypso, to allow the visual definition of data structures programs using pictorial patte ...
  • Exact learning of unordered tree patterns from queries 
    Oregon State University. Dept. of Computer Science; Amoth, Thomas R.; Cull, Paul, 1943-; Tadepalli, Prasad (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1999-05-14)
    We consider learning tree patterns from queries extending our preceding work [Amoth, Cull, & Tadepalli, 1998]. The instances in this paper are unordered trees with nodes labeled by constant identifiers. The concepts ...
  • Fast walking tree method via recurrence reduction for biological string alignment 
    Oregon State University. Dept. of Computer Science; Hsu, Tai C.; Cull, Paul, 1943- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2002)
    The meaning of biological sequences is a central problem of modern biology. Although string matching is well understood in the edit-distance model, biological strings with transpositions and inversions violate this mo ...
  • Improved parallel and sequential walking tree methods for biological string alignments 
    Oregon State University. Dept. of Computer Science; Cull, Paul, 1943-; Hsu, Tai C. (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1999)
    Approximate string matching is commonly used to align genetic sequences (DNA or RNA) to determine their shared characteristics. Most genetic string matching methods are based on the edit-distance model, which does not p ...
  • Isomorphism and the N-Queens problem 
    Oregon State University. Dept. of Computer Science; Cull, Paul, 1943-; Pandey, Rajeev K. (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1994-02-11)
    The N-Queens problem is commonly used to teach the programming technique of backtrack search. The N-Queens problem may also be used to illustrate the important concept of isomorphism. Here we show how the N-Queens proble ...
  • NET PROPHET : McCulloch and developments from his neural net model 
    Oregon State University. Dept. of Computer Science; Cull, Paul, 1943- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1996-02)
    "Fifty years after the pioneering work of McCulloch and Pitts, the study of neural nets is alive and active. In this paper, I have discussed some of the work that is of current interest to me and my co-workers. I would, ...
  • Neural nets : classical results and current problems 
    Oregon State University. Dept. of Computer Science; Cull, Paul, 1943- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1995-04)
    This note briefly discusses some of the classical results of McCulloch and Pitts. It then deals with some current research in neural nets. Several questions about neural nets are shown to be computationally difficult by ...
  • Perfect codes, NP-completeness, and Towers of Hanoi graphs 
    Oregon State University. Dept. of Computer Science; Cull, Paul, 1943-; Nelson, Ingrid (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1998)
    The set of codewords for a standard error-correcting code can be viewed as subset of the vertices of a hypercube. Two vertices are adjacent in a hypercube exactly when their Hamming distance is 1. A code is a perfect-er ...
  • Rounding the solutions of Fibonacci-like difference equations 
    Oregon State University. Dept. of Computer Science; Capocelli, Renato M.; Cull, Paul, 1943- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2002-05)
    It is well known that the Fibonacci numbers can be expressed in the form Round {1/√5 λ₀[superscript n]} where λ₀ = (1 + √5)/2. [Knu75] We look at integer sequences which are solutions to non-negative difference equation ...
  • Stability in discrete population models 
    Oregon State University. Dept. of Computer Science; Cull, Paul, 1943-; Chaffee, J. (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1999)
    One dimensional nonlinear difference equations have been used to model population growth. The standard biological models have the interesting characteristic that they display global stability if they display local stabi ...
  • A visual language for data structures programming 
    Oregon State University. Dept. of Computer Science; Wodtli, Richard; Cull, Paul, 1943- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1996-09)
    Data structures are more easily understood when they are presented visually rather than textually. We have developed a system, Calypso, to allow the visual definition of data structures programs using pictorial pattern/a ...
  • Walking tree heuristics for biological string alignment, gene location, and phylogenies 
    Oregon State University. Dept. of Computer Science; Cull, Paul, 1943-; Holloway, James Lee; Cavener, Jeffrey Douglas (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1998)
    Basic biological information is stored in strings of nucleic acids (DNA, RNA) or amino acids (proteins). Teasing out the meaning of these strings is a central problem of modern biology. Matching and aligning strings br ...

Search ScholarsArchive@OSU


Advanced Search

Browse

My Account

Statistics