Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signatu...
As mobile devices get ubiquitous and grow in computational power, their management of interdependent data also becomes increasingly important. The mobile environment exhibits all ...
Subhasish Mazumdar, Mateusz Pietrzyk, Panos K. Chr...
This paper presents recent work in computational modelling of diffusing gaseous neuromodulators in biological nervous systems. It goes on to describe work in adaptive autonomous sy...
Phil Husbands, Andrew Philippides, Tom Smith, Mich...
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...