4074 search results - page 328 / 815 » Abstract Graph Transformation |
136
click to vote
ISSS
1998
IEEE
15 years 11 months ago
1998
IEEE
Bit-true simulation veri es the nite word length choices in the VLSI implementation of a DSP application. Present-day bit-true simulation tools are time consuming. We elaborate a ...
163
click to vote
VLSID
1996
IEEE
15 years 10 months ago
1996
IEEE
Existing systolic architectures for the LMS algorithm with delayed coeficient adaptation have large adaptation delay and hence degraded convergence behaviour. This paper presents ...
148
click to vote
NAACL
2003
15 years 8 months ago
2003
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than o...
173
click to vote
SGP
2003
15 years 8 months ago
2003
In this paper we develop a new description for subdivision surfaces based on a graph grammar formalism. Subdivision schemes are specified by a context sensitive grammar in which ...
173
click to vote
ENTCS
2008
15 years 6 months ago
2008
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...