861 search results - page 100 / 173 » Faster integer multiplication |
144
click to vote
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
122
click to vote
IPPS
1996
IEEE
15 years 6 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
129
click to vote
HIPEAC
2007
Springer
15 years 6 months ago
2007
Springer
Fine-grained program power behavior is useful in both evaluating power optimizations and observing power optimization opportunities. Detailed power simulation is time consuming and...
118
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
High efficiency in capacity utilization and fast restoration are two primary goals of survivable design in optical networks. Shared backup path protection has been shown to be effi...
122
click to vote
PKC
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...