526 search results - page 1 / 106 » Improved Decomposition of STGs |
ACSD
2005
IEEE
13 years 11 months ago
2005
IEEE
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
APN
2005
Springer
13 years 10 months ago
2005
Springer
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
ACSD
2007
IEEE
13 years 11 months ago
2007
IEEE
Signal Transition Graphs (STG) are a formalism for the description of asynchronous circuit behaviour. In this paper we propose (and justify) a formal semantics of nondeterministic...
MM
2009
ACM
13 years 10 months ago
2009
ACM
In this work the problem of automatic decomposition of video into elementary semantic units, known in the literature as scenes, is addressed. Two multi-modal automatic scene segme...
TCAD
1998
13 years 4 months ago
1998
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...