This paper is part of a project to match descriptions of real-world instances and probabilistic models, both of which can be described at mulvel of abstraction and detail. We use ...
This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product rel...
Background: Currently, there is a gap between purely theoretical studies of the topology of large bioregulatory networks and the practical traditions and interests of experimental...
In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (t...
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...