Sciweavers

11580 search results - page 425 / 2316
» Communication vs. Computation
Sort
View
ACIVS
2008
Springer
16 years 19 days ago
Parallel Algorithm for Concurrent Computation of Connected Component Tree
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelizati...
P. Matas, Eva Dokladalova, Mohamed Akil, Thierry G...
ISCA
2006
IEEE
120views Hardware» more  ISCA 2006»
16 years 9 days ago
Interconnection Networks for Scalable Quantum Computers
We show that the problem of communication in a quantum computer reduces to constructing reliable quantum channels by distributing high-fidelity EPR pairs. We develop analytical m...
Nemanja Isailovic, Yatish Patel, Mark Whitney, Joh...
155
Voted
INFOCOM
2003
IEEE
15 years 11 months ago
Computing the Types of the Relationships between Autonomous Systems
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
Giuseppe Di Battista, Maurizio Patrignani, Maurizi...
QCQC
1998
Springer
110views Communications» more  QCQC 1998»
15 years 10 months ago
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
Michele Mosca, Artur Ekert
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb