We propose a practical technique to compile pattern-matching for prioritised overlapping patterns in equational languages into a minimal, deterministic, left-toright, matching automaton. First, we present a method for constructing a tree matching automaton for such patterns. This allows pattern-matching to be performed without any backtracking. Space requirements are reduced by using a directed...

Given two strings: pattern P and text T of lengths jPj =M and jT j = N . A string matching problem is to nd all occurrences of pattern P in text T . A fully compressed string matching problem is the string matching problem with input strings P and T given in compressed forms p and t respectively, where jpj = m and jtj = n. We present rst, almost optimal, string matching algorithms for LZW-compr...

The optimal coding hypothesis proposes that the human visual system has adapted to the statistical properties of the environment by the use of relatively simple optimality criteria. We here (i) discuss how the properties of different models of image coding, i.e. sparseness, decorrelation, and statistical independence are related to each other (ii) propose to evaluate the different models by ver...

We present a Bayes optimal framework to improve existing pattern classification methods. The idea is that we first derive a new space of representations where the Bayes error is potentially to be smaller, and then any classification approaches can be directly employed in this space to obtain higher classification accuracies. Extensive experiments with well-known classification approaches demons...

Many different species have been suggested to forage according to a Lévy walk in which the distribution of step lengths is heavy-tailed. Theoretical research has shown that a Lévy exponent of approximately 2 can provide a higher foraging efficiency than other exponents. In this paper, a composite search model is presented for non-destructive foraging behaviour based on Brownian (i.e. non-heavy-...