Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
There are two ways to define a semantics for process algebras: either directly by means of an equivalence relation or by means of a preorder whose kernel is the desired equivalenc...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
Olav Geil, Carlos Munuera, Diego Ruano, Fernando T...
As long as no cooperation between processes is supposed to take place, one may consider them separately and need not ask for the progress of the respective other processes. If a c...