1772 search results - page 221 / 355 » Classifying Problems into Complexity Classes |
107
Voted
TKDE
2002
15 years 10 days ago
2002
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
104
click to vote
WG
2010
Springer
14 years 11 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
169
Voted
TSP
2012
13 years 8 months ago
2012
Abstract—In this paper, we investigate the problem of designing compact-support interpolation kernels for a given class of signals. By using calculus of variations, we simplify t...
70
Voted
IJON
2006
15 years 21 days ago
2006
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...
123
Voted
JMLR
2008
15 years 21 days ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...