Sciweavers

1414 search results - page 255 / 283
» Randomness and Universal Machines
Sort
View
SIGMETRICS
2005
ACM
147views Hardware» more  SIGMETRICS 2005»
14 years 3 months ago
Denial-of-service resilience in peer-to-peer file sharing systems
Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. Th...
Dan Dumitriu, Edward W. Knightly, Aleksandar Kuzma...
PROVSEC
2009
Springer
14 years 2 months ago
Oracle Separation in the Non-uniform Model
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
Ahto Buldas, Sven Laur, Margus Niitsoo
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 2 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
DGO
2008
126views Education» more  DGO 2008»
13 years 11 months ago
Active learning for e-rulemaking: public comment categorization
We address the e-rulemaking problem of reducing the manual labor required to analyze public comment sets. In current and previous work, for example, text categorization techniques...
Stephen Purpura, Claire Cardie, Jesse Simons
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 11 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...