Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Recent works in object recognition often use visual words, i.e. vector quantized local descriptors extracted from the images. In this paper we present a novel method to build such ...
This paper investigates the use of Euclidean invariant features in a generalization of iterative closest point registration of range images. Pointwisecorrespondences are chosen as...
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Abstract. We tackle the problem of multi-class relational sequence learning using relevant patterns discovered from a set of labelled sequences. To deal with this problem, firstly...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...