461 search results - page 19 / 93 » Splitting NP-Complete Sets |
CADE
2009
Springer
16 years 1 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
PAKDD
2004
ACM
15 years 6 months ago
2004
ACM
We introduce a numerical measure on sets of partitions of finite sets that is linked to the Goodman-Kruskal association index commonly used in statistics. This measure allows us t...
111
Voted
JAPLL
2008
15 years 1 months ago
2008
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
143
Voted
SMI
2006
IEEE
15 years 7 months ago
2006
IEEE
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
107
Voted
CIKM
2000
Springer
15 years 5 months ago
2000
Springer
Recently there has been significant interest in supervised learning algorithms that combine labeled and unlabeled data for text learning tasks. The co-training setting [1] applie...