35 search results - page 3 / 7 » Finding heap-bounds for hardware synthesis |
ACSD
2007
IEEE
14 years 13 days ago
2007
IEEE
Today there are many process mining techniques that allow for the automatic construction of process models based on event logs. Unlike synthesis techniques (e.g., based on regions...
TVCG
2012
11 years 8 months ago
2012
—This paper presents a 2D flow visualization user study that we conducted using new methodologies to increase the objectiveness. We evaluated grid-based variable-size arrows, eve...
ICCD
2008
IEEE
14 years 3 months ago
2008
IEEE
—In this paper, a new FIR digital filter synthesis algorithm is proposed to consider multiple adder graphs for a coefficient. The proposed algorithm selects an adder graph that c...
ACSD
2007
IEEE
13 years 10 months ago
2007
IEEE
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
DATE
2004
IEEE
13 years 9 months ago
2004
IEEE
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...