2314 search results - page 226 / 463 » Minimal Partitions of a Graph |
143
click to vote
NIPS
2001
15 years 5 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
144
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
114
click to vote
PAMI
1998
15 years 4 months ago
1998
—Image segmentation is fundamental to many image analysis problems. It aims to partition a digital image into a set of nonoverlapping homogeneous regions. The main contribution o...
129
click to vote
CONCUR
1991
Springer
15 years 8 months ago
1991
Springer
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...
142
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...