2095 search results - page 295 / 419 » Improved pebbling bounds |
161
click to vote
SPAA
2005
ACM
15 years 12 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
145
click to vote
EUROCRYPT
2005
Springer
15 years 12 months ago
2005
Springer
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 ...
165
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
166
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
157
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
Online transaction processing (OLTP) is a multibillion dollar industry with high-end database servers employing state-of-the-art processors to maximize performance. Unfortunately,...