417 search results - page 28 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
EJC
2007
13 years 8 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
INFORMATICALT
2007
13 years 8 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
DAC
1993
ACM
14 years 18 days ago
1993
ACM
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
IAT
2009
IEEE
14 years 10 days ago
2009
IEEE
Abstract--This paper is focusing on exact Bayesian reasoning in systems of agents, which represent weakly coupled processing modules supporting collaborative inference through mess...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...