We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from poss...
Abstract. The aim of this paper is to introduce a novel, biologically inspired approach to extract visual features relevant for controlling and understanding reachto-grasp actions....
Face recognition is among the most challenging techniques for personal identity verification. Even though it is so natural for humans, there are still many hidden mechanisms which ...
Massimo Tistarelli, Linda Brodo, Andrea Lagorio, M...