4581 search results - page 140 / 917 » Computing Transformation Semigroups |
171
click to vote
ISSAC
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
161
click to vote
ASP
2001
Springer
15 years 11 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
163
click to vote
ICECCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Design of embedded systems is a complex task that requires design cycles founded upon formal notation, so that the synthesis from specification to implementation can be carried ou...
177
click to vote
ICCAD
1996
IEEE
15 years 10 months ago
1996
IEEE
In this paper we present an ecient technique to reduce the switching activity in a CMOS combinational logic network based on local logic transformations. These transformations con...
176
click to vote
LOPSTR
1994
Springer
15 years 10 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...