Sciweavers

755 search results - page 99 / 151
» Graph Transformation for Topology Modelling
Sort
View
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
14 years 1 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
COMPGEOM
2010
ACM
14 years 1 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 8 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
VL
2000
IEEE
130views Visual Languages» more  VL 2000»
14 years 1 months ago
An OO Visual Language Definition Approach Supporting Multiple Views
The formal approach to visual language definition is to use graph grammars and/or graph transformation techniques. These techniques focus on specifying the syntax and manipulation...
David H. Akehurst
CEC
2007
IEEE
14 years 21 days ago
Theoretical derivation, analysis and empirical evaluation of a simpler Particle Swarm Optimiser
In this paper we derive a simpler form of Particle Swarm Optimiser (PSO) which still retains the key properties of the original model. We do so by progressively altering the origin...
Riccardo Poli, Dan Brattonx, Tim Blackwell, James ...