526 search results - page 36 / 106 » On the Number of Minimal Addition Chains |
TCAD
1998
14 years 9 months ago
1998
Conventional scan design imposes considerable area and delay overhead by using larger scan
ip-
ops and additional scan wires without utilizing the functionality of the combinatio...
DSD
2010
IEEE
14 years 7 months ago
2010
IEEE
Asynchronous circuit implementations operating under strong constraints (DIMS, Direct Logic, some of NCL gates, etc.) are attractive due to: 1) regularity; 2) combined implementati...
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
Linear DSP kernels such as transforms and filters are comprised exclusively of additions and multiplications by constants. These multiplications may be realized as networks of ad...
CASES
2006
ACM
15 years 3 months ago
2006
ACM
Architectural advances of modern systems has often been at odds with control complexity, requiring significant effort in both design and verification. This is particularly true ...
COLT
1999
Springer
15 years 2 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...