560 search results - page 53 / 112 » Multiplication by a Constant is Sublinear |
DAGSTUHL
1996
13 years 9 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
EOR
2008
13 years 8 months ago
2008
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
SIGECOM
2008
ACM
13 years 8 months ago
2008
ACM
We examine a model in which multiple buyers with single-unit demand are faced with an infinite sequence of auctions. New buyers arrive on the market probabilistically, and are each...
TC
2008
13 years 8 months ago
2008
Since redundant number systems allow for constant time addition, they are often at the heart of modular multipliers designed for public key cryptography (PKC) applications. Indeed,...
INTEGRATION
2002
13 years 7 months ago
2002
Booth Recoding is a commonly used technique to recode one of the operands in binary multiplication. In this way the implementation of a multipliers' adder tree can be improve...