Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
Recent research in automated learning has focused on algorithms that learn from a combination of tagged and untagged data. Such algorithms can be referred to as semi-supervised in...
This paper offers a novel detection method, which works well even in the case of a complicated image collection – for instance, a frontal face under a large class of linear tran...
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...