Sciweavers

991 search results - page 69 / 199
» The query-flow graph: model and applications
Sort
View
ACSD
2006
IEEE
105views Hardware» more  ACSD 2006»
14 years 4 months ago
Throughput Analysis of Synchronous Data Flow Graphs
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...
IFIP12
2007
14 years 7 days ago
Clustering Improves the Exploration of Graph Mining Results
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
LICS
2010
IEEE
13 years 9 months ago
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
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 ...
Martin Otto
GPC
2010
Springer
14 years 2 months ago
Actor Garbage Collection Using Vertex-Preserving Actor-to-Object Graph Transformations
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-...
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
14 years 3 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