Sciweavers

212 search results - page 11 / 43
» Complexity Parameters for First-Order Classes
Sort
View
SAT
2007
Springer
75views Hardware» more  SAT 2007»
14 years 25 days ago
Matched Formulas and Backdoor Sets
We demonstrate hardness results for the detection of small backdoor sets with respect to base classes Mr of CNF formulas with maximum deficiency ≤ r (M0 is the class of matched...
Stefan Szeider
ALT
2009
Springer
14 years 3 months ago
Complexity versus Agreement for Many Views
Abstract. The paper considers the problem of semi-supervised multiview classification, where each view corresponds to a Reproducing Kernel Hilbert Space. An algorithm based on co-...
Odalric-Ambrym Maillard, Nicolas Vayatis
IJSYSC
2010
97views more  IJSYSC 2010»
13 years 5 months ago
A stability study on first-order neutral systems with three rationally independent time delays
— First order linear time invariant and time delayed dynamics of neutral type is taken into account with three rationally independent delays. There are two main contributions of ...
Rifat Sipahi, Nejat Olgaç, Dimitri Breda
ECCC
2007
90views more  ECCC 2007»
13 years 6 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
PAMI
2007
187views more  PAMI 2007»
13 years 6 months ago
Supervised Learning of Semantic Classes for Image Annotation and Retrieval
—A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as...
Gustavo Carneiro, Antoni B. Chan, Pedro J. Moreno,...