1221 search results - page 98 / 245 » Balanced graph partitioning |
109
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
162
Voted
SC
1993
ACM
15 years 6 months ago
1993
ACM
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...
138
Voted
CASES
2001
ACM
15 years 6 months ago
2001
ACM
We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy...
114
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
133
Voted
COMBINATORICS
2006
15 years 2 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...