It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
In this paper we describe an online/incremental linear binary classifier based on an interesting approach to estimate the Fisher subspace. The proposed method allows to deal with ...
Alessandro Rozza, Gabriele Lombardi, Marco Rosa, E...
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...
— In this paper, we present our research efforts in exploring the role of motion and actuation in human-robot interaction. We define Emotive Actuation, and briefly discuss its fu...
This paper presents a method for the automatic discovery of MANNER relations from text. An extended definition of MANNER is proposed, including restrictions on the sorts of concep...