Sciweavers

1450 search results - page 256 / 290
» On the Complexity of Hardness Amplification
Sort
View
SIGMETRICS
2010
ACM
233views Hardware» more  SIGMETRICS 2010»
14 years 16 days ago
Incentivizing peer-assisted services: a fluid shapley value approach
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
Vishal Misra, Stratis Ioannidis, Augustin Chaintre...
SIGMOD
2010
ACM
598views Database» more  SIGMOD 2010»
14 years 16 days ago
Ricardo: integrating R and Hadoop
Many modern enterprises are collecting data at the most detailed level possible, creating data repositories ranging from terabytes to petabytes in size. The ability to apply sophi...
Sudipto Das, Yannis Sismanis, Kevin S. Beyer, Rain...
SPAA
2010
ACM
14 years 16 days ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 16 days ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 15 days ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor