Sciweavers

700 search results - page 132 / 140
» An Introduction to Quantum Computing
Sort
View
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
14 years 8 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
FOCS
2008
IEEE
14 years 2 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
SIBGRAPI
2003
IEEE
14 years 27 days ago
Helical CT Reconstruction from Wide Cone-Beam Angle Data Using ART
We report on new results on the use of Algebraic Reconstruction Techniques (ART) for reconstructing from helical cone-beam Computerized Tomography (CT) data. We investigate two va...
Bruno M. Carvalho, Gabor T. Herman
VTS
2003
IEEE
115views Hardware» more  VTS 2003»
14 years 27 days ago
Fault Testing for Reversible Circuits
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...
Ketan N. Patel, John P. Hayes, Igor L. Markov
ASIACRYPT
2000
Springer
14 years 1 hour ago
Unconditionally Secure Digital Signature Schemes Admitting Transferability
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hi...