## Search

Now showing items 1-10 of 16

#### Inverting random functions

(University of Canterbury. Mathematics and Statistics., 1999)

In this paper we study how to invert random functions under different
criteria. The motivation for this study is phylogeny reconstruction, since
the evolution of biomolecular sequences may be considered as a random ...

#### Monitoring the processing of interactive requests on distributed systems

(Department of Computer Science, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1995)

Distributed systems, and systems with microkernel architectures, are becoming widely used. A consequence is that
the processing required to perform a user request is often spread over many computers, many programs and ...

#### A Random Access Protocol for Unidirectional Bus Networks

(University of Canterbury. Computer Science and Software EngineeringUniversity of Canterbury. Electrical and Computer Engineering, 1995)

A random access protocol for packet-switched,
multiple access communication via time slotted busses is investigated. Assuming heavy traffic for all stations, the access
probabilities are determined as to allocate a certain ...

#### A Calculus Based on Absence of Actions

(Department of Computer Science, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1995)

In this article we present a process algebra where the behaviour can be
specified when certain actions cannot be exhibited. This is useful in specifying
time outs, interrupts etc. We present a few properties which form ...

#### k-regular matroids

(University of Canterbury. Mathematics and Statistics., 1997)

The class of matroids representable over all fields is the class of regular matroids. The class of matroids representable over all fields except perhaps GF(2) is the class of near-regular matroids. This paper considers ...

#### A Survey of Confidence Interval Formulae for Coverage Analysis

(Department of Computer Science and Management, University of CanterburyUniversity of Canterbury. Computer Science and Software EngineeringUniversity of Canterbury. Management, 1998)

Confidence interval estimators for proportions using normal approximation have been
commonly used for coverage analysis of simulation output even though alternative approximate estimators of confidence intervals for ...

#### The length of a random leaf coloration on a random tree.

(University of Canterbury. Mathematics and Statistics, 1997)

An assignment of colors to objects induces a natural integer weight on each tree that has these objects as leaves. This weight is called "parsimony length" in biostatistics and is the basis of the "maximum parsimony" ...

#### Automating Parallel and Distributed Quantative Stochastic Simulation

(University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1996)

#### On maximum-sized k-regular matroids

(University of Canterbury. Mathematics and Statistics., 1999)

Let k be an integer exceeding one. The class of k–regular matroids is a generalization of the classes of regular and near-regular matroids. A simple rank–r regular matroid has the maximum number of points if and only if ...

#### Tree representations of non-symmetric, group-valued proximities

(University of Canterbury. Mathematics and Statistics., 1999)

Let X be a finite set and let d be a function from X x X into an
arbitrary group G. An example of such a function arises by taking a tree T whose vertices include X, assigning two elements of G to each edge of T (one for ...