1977 search results - page 133 / 396 » The satisfactory partition problem |
153
click to vote
PDIS
1993
IEEE
15 years 10 months ago
1993
IEEE
semantic knowledge all concurrent partitionedAbstract updates to an object must be treated as conflicting, andOptimistic replication is an important technique for merged manually b...
167
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
155
click to vote
HPCC
2005
Springer
16 years 23 hour ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
165
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
147
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...