Sciweavers

16994 search results - page 3141 / 3399
» Improving the Performance of maxRPC
Sort
View
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 11 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
FCT
1997
Springer
15 years 11 months ago
Trade-Off Results for Connection Management
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...
Marios Mavronicolas, Nikos Papadakis
FODO
1993
Springer
110views Algorithms» more  FODO 1993»
15 years 11 months ago
Storage System Architectures for Continuous Media Data
Abstract. Data storage systems are being called on to manage continuous media data types, such as digital audio and video. There is a demand by applications for \constrained-latenc...
David Maier, Jonathan Walpole, Richard Staehli
ASPLOS
1992
ACM
15 years 11 months ago
Parity Declustering for Continuous Operation in Redundant Disk Arrays
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
Mark Holland, Garth A. Gibson
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 11 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
« Prev « First page 3141 / 3399 Last » Next »