4277 search results - page 72 / 856 » On Multiple Linear Approximations |
FPL
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a design and optimization technique for the Multiple Restricted Multiplication problem [1]. This refers to a situation where a single variable is multiplied by...
FPL
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper focuses on a class of problem relating to the multiplication of a single number by several coefficients that, while not constant, are drawn from a finite set ...
108
click to vote
ISCAS
2011
IEEE
14 years 1 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
DAC
2004
ACM
15 years 11 months ago
2004
ACM
An important primitive in the hardware implementations of linear DSP transforms is a circuit that can multiply an input value by one of several different preset constants. We prop...
AAIM
2008
Springer
15 years 2 hour ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.