2131 search results - page 45 / 427 » Immunity for Closed Sets |
STACS
2007
Springer
15 years 3 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
110
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
In various application domains, including image recognition, it is natural to represent each example as a set of vectors. With a base kernel we can implicitly map these vectors to...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
PR
2000
14 years 9 months ago
2000
Based on the observation that rough sets and mathematical morphology are both using dual operators sharing similar properties, we investigate more closely the links existing betwe...