532 search results - page 43 / 107 » New Results on the Complexity of the Middle Bit of Multiplic... |
ICPP
1992
IEEE
14 years 1 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
BROADNETS
2006
IEEE
14 years 3 months ago
2006
IEEE
— As an optical signal propagates along a lightpath to its destination in wavelength-routed optical networks (WRONs), the quality of service (QoS) will be degraded by transmissio...
ARITH
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract. We present efficient squaring formulae based on the Toom-Cook multiplication algorithm. The latter always requires at least one non-trivial constant division in the inte...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
We propose a cluster-based web server where a few computing nodes are separately reserved for high-performance computing applications, such as multimedia, SSL, and CGI. As an exam...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...