Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
Let A ⊂ L2(R) be at most countable, and p, q ∈ N. We characterize various frame-properties for Gabor systems of the form G(1, p/q,A) = {e2 imxg(x − np/q) : m, n ∈ Z, g ∈...
Abstract--The stationarity requirement for the process generating the data is a common assumption in classifiers' design. When such hypothesis does not hold, e.g., in applicat...
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...