Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Abstract. Ahardware and software environment with performance above 1 Tera ops (teracomputing) is presently required to face the leading computational challenges not only in fundam...
In this paper the Northrhine-Westphalian metacomputing initiative is described. We start by discussing various general aspects of metacomputing and explain the reasons for founding...