In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Thispaper presents a text word extraction algorithm that takes a set of bounding boxes of glyphs and their associated text lines of a given document andpartitions the glyphs into ...
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...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...