4520 search results - page 76 / 904 » Algebraic Techniques for Timed Systems |
120
click to vote
FCCM
1999
IEEE
15 years 6 months ago
1999
IEEE
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
232
click to vote
POPL
2004
ACM
16 years 2 months ago
2004
ACM
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
135
click to vote
COCO
2008
Springer
15 years 3 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
160
click to vote
CLUSTER
2011
IEEE
14 years 1 months ago
2011
IEEE
—Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level 3 BLAS, which are not only efficient for serial computation, but...
104
click to vote
SRDS
2003
IEEE
15 years 7 months ago
2003
IEEE
The perfectly synchronized round model provides the abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We p...