Sciweavers

2767 search results - page 268 / 554
» Universal Exponentiation Algorithm
Sort
View
FOCS
2007
IEEE
15 years 9 months ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
JSSPP
2007
Springer
15 years 9 months ago
A Job Self-scheduling Policy for HPC Infrastructures
The number of distributed high performance computing architectures has increased exponentially these last years. Thus, systems composed by several computational resources provided ...
Francesc Guim, Julita Corbalán
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 9 months 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
EUROCRYPT
2005
Springer
15 years 8 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
IMC
2004
ACM
15 years 8 months ago
An analysis of live streaming workloads on the internet
In this paper, we study the live streaming workload from a large content delivery network. Our data, collected over a 3 month period, contains over 70 million requests for 5,000 d...
Kunwadee Sripanidkulchai, Bruce M. Maggs, Hui Zhan...