Sciweavers

418 search results - page 80 / 84
» An Optimization Framework for Query Recommendation
Sort
View
ICS
2010
Tsinghua U.
14 years 4 months ago
Distribution-Specific Agnostic Boosting
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...
Vitaly Feldman
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 7 months ago
Lower bounds for dynamic connectivity
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...
Mihai Patrascu, Erik D. Demaine
IPPS
2009
IEEE
14 years 2 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
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...
Anne Benoit, Fanny Dufossé, Yves Robert
DAIS
2006
13 years 8 months ago
PAGE: A Distributed Infrastructure for Fostering RDF-Based Interoperability
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...
CVPR
2009
IEEE
1010views Computer Vision» more  CVPR 2009»
15 years 2 months ago
A Family of Contextual Measures of Similarity between Distributions with Application to Image Retrieval
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), ...