Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
Amir Hossein Ghamarian, Marc Geilen, Sander Stuijk...
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...
Wei-Jen Wang, Carlos A. Varela, Fu-Hau Hsu, Cheng-...
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...