461 search results - page 3 / 93 » Splitting NP-Complete Sets |
DEXAW
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
64
Voted
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
65
Voted
MLQ
2008
14 years 9 months ago
2008
The stationary set splitting game is a game of perfect information of length 1 between two players, unsplit and split, in which unsplit chooses stationarily many countable ordinal...
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
63
Voted
SIAMCOMP
2008
14 years 9 months ago
2008
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result a...