Sciweavers

74 search results - page 14 / 15
» Random Debaters and the Hardness of Approximating Stochastic...
Sort
View
PODS
2012
ACM
281views Database» more  PODS 2012»
11 years 8 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
ATAL
2003
Springer
13 years 11 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein
SIGMETRICS
2008
ACM
117views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Epidemic live streaming: optimal performance trade-offs
Several peer-to-peer systems for live streaming have been recently deployed (e.g. CoolStreaming, PPLive, SopCast). These all rely on distributed, epidemic-style dissemination mech...
Thomas Bonald, Laurent Massoulié, Fabien Ma...
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 5 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...