11160 search results - page 195 / 2232 » Incompleteness in a General Setting |
131
click to vote
DM
2008
15 years 3 months ago
2008
Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eu...
133
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...
134
click to vote
NIPS
2008
15 years 5 months ago
2008
Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) tha...
136
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
133
click to vote
DM
2008
15 years 2 months ago
2008
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = TU=S pT (x)pU (y). Using umbral calculus, we give a formula for t...