— A method is presented for extending the Evolving Connectionist System (ECoS) algorithm that allows it to explicitly represent and learn nominal-scale data without the need for ...
We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
—In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that t...
Dino Sejdinovic, Robert J. Piechocki, Angela Doufe...
This paper presents a new Multidirectional Binary Pattern (MBP) for face recognition. Different from most Local Binary Pattern (LBP) related approaches which cluster LBP occurrenc...
We explore the use of information models as a guide for the development of single objective optimization algorithms, giving particular attention to the use of Bayesian models in a...