We formally specify a payment protocol described in [Vogt et al., 2001]. This protocol is intended for fair exchange of time-sensitive data. Here the µCRL language is used to form...
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...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
We describe the design and implementation of a program generator that can produce extensions of Fortran that are specialized to support the programming of particular applications. ...
Abstract. This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by...
We examine the law of steering – a quantitative model of human movement time in relation to path width and length previously established in hand drawing movement – in a VR loc...