Sciweavers

Share
ECEASST
2011
302views ECommerce» more  ECEASST 2011»
8 years 6 months ago
Towards NFC-Aware Process Execution for Dynamic Environments
Kristof Hamann, Sebastian Steenbuck, Sonja Zaplata
ECEASST
2011
241views ECommerce» more  ECEASST 2011»
8 years 6 months ago
Analysis of Car-to-Car Beaconing with Network Coding
Nasir Ali, Daniel Baselt, Hermann de Meer
ECCC
2011
207views ECommerce» more  ECCC 2011»
8 years 6 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
ECCC
2011
160views ECommerce» more  ECCC 2011»
8 years 6 months ago
Robust Lower Bounds for Communication and Stream Computation
Amit Chakrabarti, Graham Cormode, Andrew McGregor
ECCC
2011
185views ECommerce» more  ECCC 2011»
8 years 6 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
ECCC
2011
180views ECommerce» more  ECCC 2011»
8 years 6 months ago
Two Comments on Targeted Canonical Derandomizers
We revisit the notion of a targeted canonical derandomizer, introduced in our recent ECCC Report (TR10-135) as a uniform notion of a pseudorandom generator that suffices for yield...
Oded Goldreich
ECCC
2011
202views ECommerce» more  ECCC 2011»
8 years 6 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
ECCC
2011
183views ECommerce» more  ECCC 2011»
8 years 6 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
books