112 search results - page 9 / 23 » Rounds in Communication Complexity Revisited |
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
PC
2002
13 years 7 months ago
2002
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
SPAA
2010
ACM
14 years 14 days ago
2010
ACM
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to o...
IMC
2010
ACM
13 years 5 months ago
2010
ACM
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...