Sciweavers

1772 search results - page 77 / 355
» Classifying Problems into Complexity Classes
Sort
View
98
Voted
ECCC
2007
90views more  ECCC 2007»
15 years 15 days 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
70
Voted
IPL
2008
65views more  IPL 2008»
15 years 16 days ago
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
Iain A. Stewart
ICIAR
2005
Springer
15 years 6 months ago
On the Individuality of the Iris Biometric
We consider quantitatively establishing the discriminative power of iris biometric data. It is difficult, however, to establish that any biometric modality is capable of distingui...
Sungsoo Yoon, Seung-Seok Choi, Sung-Hyuk Cha, Yill...
MCS
2010
Springer
15 years 2 months ago
Dynamic Selection of Ensembles of Classifiers Using Contextual Information
In a multiple classifier system, dynamic selection (DS) has been used successfully to choose only the best subset of classifiers to recognize the test samples. Dos Santos et al...
Paulo Rodrigo Cavalin, Robert Sabourin, Ching Y. S...
118
Voted
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 29 days ago
Learning a complex metabolomic dataset using random forests and support vector machines
Metabolomics is the omics science of biochemistry. The associated data include the quantitative measurements of all small molecule metabolites in a biological sample. These datase...
Young Truong, Xiaodong Lin, Chris Beecher