Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. ...
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
We give a self-contained exposition of selected results in additive combinatorics over the group GF(2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Bal...
This paper presents an efficient method of learning motion control for autonomous animated characters. The method uses a non parametric learning approach which identifies non line...
Suppose a function of N real source variables XN 1 = (X1, X2, . . . , XN ) is desired at a destination constrained to receive a limited number of bits. If the result of evaluating...