16666 search results - page 2840 / 3334 » Descriptive and Computational Complexity |
183
click to vote
EUROPAR
2005
Springer
16 years 14 days ago
2005
Springer
Abstract. To analyze the correctness and the performance of a program, information about the dynamic behavior of all participating processes is needed. The dynamic behavior can be ...
167
click to vote
FIMH
2005
Springer
16 years 14 days ago
2005
Springer
Abstract. In this paper we present a novel approach to the problem of spatiotemporal alignment of cardiac MR image sequences. This novel method has the ability to correct spatial m...
173
click to vote
GD
2005
Springer
16 years 14 days ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
173
click to vote
GD
2005
Springer
16 years 14 days ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
192
click to vote
GD
2005
Springer
16 years 14 days ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...