16 search results - page 2 / 4 » The complexity of class polynomial computation via floating ... |
FOCS
1995
IEEE
13 years 9 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
LATIN
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
ECML
2003
Springer
13 years 11 months ago
2003
Springer
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
ECCC
2006
13 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
NIPS
2003
13 years 7 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...