Sciweavers

111 search results - page 10 / 23
» Randomized computations on large data sets: tight lower boun...
Sort
View
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
ADHOCNOW
2004
Springer
14 years 26 days ago
Analysis of the Information Propagation Time Among Mobile Hosts
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...
SPAA
2005
ACM
14 years 1 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 7 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
GPEM
2007
119views more  GPEM 2007»
13 years 7 months ago
Genomic mining for complex disease traits with "random chemistry"
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...