A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
Tal Shima, Steven J. Rasmussen, Andrew G. Sparks, ...
Reservoir Computing (RC) techniques use a fixed (usually randomly created) recurrent neural network, or more generally any dynamic system, which operates at the edge of stability,...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC codes. The original McEliece cryptosystem, based on Goppa codes, is still unbroken up to now,...