874 search results - page 80 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
ISVLSI
2002
IEEE
14 years 1 months ago
2002
IEEE
Modular inverse computation is needed in several public key cryptographic applications. In this work, we present two VLSI hardware implementations used in the calculation of Montg...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
TWC
2008
13 years 9 months ago
2008
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
SPAA
1996
ACM
14 years 1 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...