Sciweavers

350 search results - page 66 / 70
» An optimization framework for map-reduce queries
Sort
View
110
Voted
AMW
2009
15 years 1 months ago
Checking Containment of Schema Mappings (Preliminary Report)
In data exchange, data are materialised from a source schema to a target schema, according to suitable source-to-target constraints. Constraints are also expressed on the target sc...
Andrea Calì, Riccardo Torlone
139
Voted
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
13 years 3 months ago
Web image prediction using multivariate point processes
In this paper, we investigate a problem of predicting what images are likely to appear on the Web at a future time point, given a query word and a database of historical image str...
Gunhee Kim, Fei-Fei Li, Eric P. Xing
106
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 26 days 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
99
Voted
ICS
2010
Tsinghua U.
15 years 10 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
IPPS
2009
IEEE
15 years 7 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