2314 search results - page 1 / 463 » Minimal Partitions of a Graph |
155
Voted
JMMA
2010
14 years 10 months ago
2010
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
93
Voted
ARSCOM
1999
15 years 3 months ago
1999
For a given graph G, we fix s, and partition the vertex set into s classes, so that any given class contains few edges. The result gives a partition (U1,
122
Voted
ISCAPDCS
2003
15 years 4 months ago
2003
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
149
Voted
SOFSEM
2005
Springer
15 years 9 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
156
Voted
ICASSP
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...