We consider the problem of learning to map between two vector spaces given pairs of matching vectors, one from each space. This problem naturally arises in numerous vision problem...
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Data mining evolved as a collection of applicative problems and efficient solution algorithms relative to rather peculiar problems, all focused on the discovery of relevant infor...
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...