49 search results - page 7 / 10 » Comparing Graph Layouts for Vertex Selection Tasks |
144
Voted
IPPS
2010
IEEE
15 years 21 days ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
113
Voted
ISLPED
2003
ACM
15 years 8 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
122
Voted
IPMI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We propose a novel algorithm called graph-shifts for performing image segmentation and labeling. This algorithm makes use of a dynamic hierarchical representation of the ...
109
Voted
IV
2003
IEEE
15 years 8 months ago
2003
IEEE
In the paper, we suggest a set of visualization-based exploratory tools to support analysis and comparison of different spatial development scenarios, such as results of simulatio...
120
Voted
ACL
2010
15 years 25 days ago
2010
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...