1130 search results - page 210 / 226 » Feature Selection for Complex Patterns |
105
click to vote
COCO
2004
Springer
15 years 3 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
128
click to vote
BMCBI
2010
14 years 12 months ago
2010
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
104
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: Overfitting the data is a salient issue for classifier design in small-sample settings. This is why selecting a classifier from a constrained family of classifiers, on...
101
click to vote
PAMI
2006
14 years 11 months ago
2006
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
121
click to vote
TCAD
2008
14 years 11 months ago
2008
Functional correctness is a vital attribute of any hardware design. Unfortunately, due to extremely complex architectures, widespread components, such as microprocessors, are often...