1951 search results - page 92 / 391 » An algorithm for improving graph partitions |
139
click to vote
NETWORKS
2008
15 years 4 months ago
2008
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
113
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
128
click to vote
ICIP
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper we present a new segmentation method for the Multidimensional Multiscale Parser (MMP) algorithm. In previous works we have shown that, for text and compound images, ...
167
click to vote
MLMTA
2007
15 years 5 months ago
2007
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
196
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...