10871 search results - page 1871 / 2175 » A stable programming language |
165
click to vote
IFIP
2004
Springer
16 years 2 days ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
141
click to vote
IFIP
2004
Springer
16 years 2 days ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
160
click to vote
IFIP
2004
Springer
16 years 2 days ago
2004
Springer
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
165
click to vote
IFIP
2004
Springer
16 years 2 days ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
165
click to vote
IFIP
2004
Springer
16 years 2 days ago
2004
Springer
We introduce an extension of the Parikh mapping called the Parikh ¢ -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represent...