We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
Statistical models of word-sense disambiguation are often based on a small number of contextual features or on a model that is assumed to characterize the interactions among a set...
—We consider a wireless cognitive radio network in which a set of secondary users (SUs) opportunistically utilize the wireless spectrum licensed to the primary users (PUs) to tra...
: This paper presents the MINERVA project that protoypes a distributed search engine based on P2P techniques. MINERVA is layered on top of a Chord-style overlay network and uses a ...
Matthias Bender, Sebastian Michel, Gerhard Weikum,...
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...