We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]....
Ingemar J. Cox, Matthew L. Miller, Thomas P. Minka...