299 search results - page 7 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
COR
2007
14 years 9 months ago
2007
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
NIPS
2001
14 years 11 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...
BMVC
2010
14 years 7 months ago
2010
This paper studies image segmentation based on the minimum description length (MDL) functional combining spatial regularization with a penality for the number of distinct segments...
110
click to vote
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
VLSID
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we present statistical timing driven hMetisbased partitioning. We approach timing driven partitioning from a different perspective: we use the statistical timing cri...