Sciweavers

1352 search results - page 101 / 271
» Fault-Tolerant Quantum Computation
Sort
View
GCC
2003
Springer
14 years 1 months ago
Grid Computing for the Masses: An Overview
Abstract. The common goals of the Grid and peer-to-peer communities have brought them in close proximity. Both the technologies overlay a collaborative resource-sharing infrastruct...
Kaizar Amin, Gregor von Laszewski, Armin R. Mikler
ICCAD
2006
IEEE
183views Hardware» more  ICCAD 2006»
14 years 4 months ago
Soft error derating computation in sequential circuits
Soft error tolerant design becomes more crucial due to exponential increase in the vulnerability of computer systems to soft errors. Accurate estimation of soft error rate (SER), ...
Hossein Asadi, Mehdi Baradaran Tahoori
SIROCCO
2003
13 years 9 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
PC
2000
120views Management» more  PC 2000»
13 years 7 months ago
Real-time sonar beamforming on high-performance distributed computers
Rapid advancements in acoustical beamforming techniques for array signal processing are producing algorithms with increased levels of computational complexity. Concomitantly, auto...
Alan D. George, Jeff Markwell, Ryan Fogarty
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
13 years 8 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng