417 search results - page 17 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
JSW
2008
13 years 8 months ago
2008
Service composition is emerging as an important paradigm for constructing distributed applications by combining and reusing independently developed component services. One key issu...
GD
1998
Springer
14 years 20 days ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
CAV
2009
Springer
14 years 14 days ago
2009
Springer
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
ISCA
1992
IEEE
14 years 16 days ago
1992
IEEE
A quantitative analysis of program execution is essential to the computer architecture design process. With the current trend in architecture of enhancing the performance of unipr...
WG
2010
Springer
13 years 6 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...