A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple ...
Abstract. Gender recognition problem has not been extensively studied in situations where the face cannot be accurately detected and it also can be partially occluded. In this cont...
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...
Abstract. We describe an approach for learning the model of the opponent in spatio-temporal negotiation. We use the Children in the Rectangular Forest canonical problem as an examp...