4074 search results - page 271 / 815 » Abstract Graph Transformation |
181
click to vote
SCIA
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...
162
click to vote
FOSSACS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
158
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
185
click to vote
AGTIVE
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper deals with knowledge-based computer aided design. A novel method giving additional support for conceptual design is presented. In this method, a designer firs...
151
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...