6142 search results - page 309 / 1229 » The Complexity of Partition Functions |
143
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
218
click to vote
DICTA
2007
15 years 8 months ago
2007
Texture segmentation is the process of partitioning an image into regions with different textures containing similar group of pixels. This paper presents a comparative study of fo...
165
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
177
click to vote
IJCAI
2001
15 years 8 months ago
2001
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
181
click to vote
NIPS
2001
15 years 8 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...