— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...
Abstract. Distribution of object colors has been used in computer vision for recognition and indexing. Most of the recent approaches to this problem have been focused on de ning op...
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
Abstract. In this paper, we show that the optimization of density forecasting models for regression in machine learning can be formulated as a multi-objective problem. We describe ...
We consider a novel problem of learning an optimal matching, in an online fashion, between two feature spaces that are organized as taxonomies. We formulate this as a multi-armed ...