We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
This paper shows how to build a scalable, robust and efficient distributed Internet-scale RDF repository, that we name PAGE (Put And Get Everywhere). 1 Motivation In the recent yea...
Emanuele Della Valle, Andrea Turati, Alessandro Gh...
During this talk, I will introduce a novel family of contextual measures of similarity between distributions: the similarity between two distributions q and p is measured in the co...
Florent Perronnin (Xerox Research Centre Europe), ...