1772 search results - page 114 / 355 » Classifying Problems into Complexity Classes |
167
click to vote
ICMLC
2010
Springer
15 years 4 months ago
2010
Springer
: Cluster size insensitive FCM (csiFCM) dynamically adjusts the membership value of each object based on the size of the cluster to which it is assigned after defuzzification to re...
171
click to vote
KI
2006
Springer
15 years 6 months ago
2006
Springer
Classifying objects in computer vision, we are faced with a great many features one can use. This paper argues that diagrammatic representations help to comprehend properties of fe...
169
click to vote
FSTTCS
2009
Springer
16 years 29 days ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
182
click to vote
ICALP
2007
Springer
16 years 16 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
162
click to vote
ESANN
2006
15 years 7 months ago
2006
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...