688 search results - page 14 / 138 » General Partitioning on Random Graphs |
105
Voted
DATE
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...
94
Voted
WAOA
2005
Springer
15 years 6 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
119
click to vote
TOG
2008
15 years 10 days ago
2008
The goal of this paper is to investigate a new shape analysis method based on randomized cuts of 3D surface meshes. The general strategy is to generate a random set of mesh segmen...
127
click to vote
CATS
2006
15 years 1 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
96
Voted
PAKDD
2004
ACM
15 years 5 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...