: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
In this work, the authors have evaluated almost 20 millions ensembles of classifiers generated by several methods. Trying to optimize those ensembles based on the nearest neighbou...
Guillaume Tremblay, Robert Sabourin, Patrick Maupi...