1772 search results - page 151 / 355 » Classifying Problems into Complexity Classes |
181
click to vote
INFORMS
2010
15 years 4 months ago
2010
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...
153
click to vote
CSUR
2000
15 years 6 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
170
click to vote
JIIS
2006
15 years 6 months ago
2006
Kernel Canonical Correlation Analysis (KCCA) is a method of correlating linear relationship between two variables in a kernel defined feature space. A machine learning algorithm b...
179
click to vote
SIAMDM
1998
15 years 6 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
161
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...