2314 search results - page 175 / 463 » Minimal Partitions of a Graph |
127
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
118
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
138
click to vote
HPDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
142
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We introduce a novel energy minimization method to decompose a video into a set of super-resolved moving layers. The proposed energy corresponds to the cost of coding the sequence...
140
click to vote
CVIU
2007
15 years 4 months ago
2007
Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation prob...