We introduce and analyze a natural algorithm for multi-venue exploration from censored data, which is motivated by the Dark Pool Problem of modern quantitative finance. We prove t...
Kuzman Ganchev, Yuriy Nevmyvaka, Michael Kearns, J...
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be either static or mobile. Even in static cases, a s...
In ad hoc wireless LANs populated by mutually impenetrable groups of anonymous stations, honest stations are prone to "bandwidth stealing" by selfish stations. The proble...
We present a novel approach to Information Presentation (IP) in Spoken Dialogue Systems (SDS) using a data-driven statistical optimisation framework for content planning and attri...
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...