In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
Abstract. Online ciphers are deterministic length-preserving permutations EK : ({0, 1}n )+ → ({0, 1}n )+ where the i-th block of ciphertext depends only on the first i blocks of...
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
We are in the midst of an explosion of emerging humancomputer interaction techniques that redefine our understanding of both computers and interaction. We propose the notion of Re...
Robert J. K. Jacob, Audrey Girouard, Leanne M. Hir...
Abstract. The outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. Most such applications are...