Negative selection algorithms for hamming and real-valued shape-spaces are reviewed. Problems are identified with the use of these shape-spaces, and the negative selection algori...
Thomas Stibor, Philipp H. Mohr, Jonathan Timmis, C...
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
Although biometrics have garnered significant interest as a source of entropy for cryptographic key generation, recent studies indicate that many biometric modalities may not actu...
Lucas Ballard, Seny Kamara, Fabian Monrose, Michae...
: Much recent educational research focuses on teaching and learning within classroom conversations. This raises the question of the role of ICT as a support for such conversations....
Abstract. In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only f...