232 search results - page 47 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
CGO
2008
IEEE
13 years 12 months ago
2008
IEEE
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...
JSAC
2007
13 years 5 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...