193 search results - page 32 / 39 » Duality in Infinite Graphs |
137
Voted
FMCAD
2006
Springer
15 years 7 months ago
2006
Springer
Synchronous Data Flow Graphs (SDFGs) have proven to be suitable for specifying and analyzing streaming applications that run on single- or multi-processor platforms. Streaming appl...
158
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
127
Voted
CSR
2008
Springer
15 years 5 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
112
click to vote
SPDP
1990
IEEE
15 years 8 months ago
1990
IEEE
In this paper, we propose a semi distributed approach, for load balancing in large parallel and distributedsystems. Theproposedschemeisa twolevel hierarchical scheme which partiti...
152
click to vote
CIE
2009
Springer
15 years 8 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...