Sciweavers

9997 search results - page 361 / 2000
» The case for crowd computing
Sort
View
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
16 years 26 days ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
WAW
2007
Springer
113views Algorithms» more  WAW 2007»
16 years 25 days ago
Local Computation of PageRank Contributions
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 21 days ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
ISM
2005
IEEE
165views Multimedia» more  ISM 2005»
16 years 10 days ago
eSports: Collaborative and Synchronous Video Annotation System in Grid Computing Environment
We designed eSports—a collaborative and synchronous video annotation platform, which is to be used in Internet scale cross-platform grid computing environment to facilitate Comp...
Gang Zhai, Geoffrey Fox, Marlon E. Pierce, Wenjun ...
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
16 years 8 days ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...