Sciweavers

3680 search results - page 594 / 736
» cases 2010
Sort
View
154
Voted
PODS
2010
ACM
232views Database» more  PODS 2010»
16 years 1 days ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
PODS
2010
ACM
242views Database» more  PODS 2010»
16 years 1 days ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
167
Voted
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 12 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
SIGMETRICS
2010
ACM
212views Hardware» more  SIGMETRICS 2010»
15 years 11 months ago
A mean field model of work stealing in large-scale systems
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
Nicolas Gast, Bruno Gaujal
193
Voted
APN
2010
Springer
15 years 11 months ago
Wendy: A Tool to Synthesize Partners for Services
Service-oriented computing proposes services as building blocks which can be composed to complex systems. To reason about the correctness of a service, its communication protocol n...
Niels Lohmann, Daniela Weinberg