13603 search results - page 2700 / 2721 » On the computational complexity of bridgecard |
190
click to vote
IJPRAI
2010
15 years 4 months ago
2010
: AUC-SVM directly maximizes the area under the ROC curve (AUC) through minimizing its hinge loss relaxation, and the decision function is determined by those support vector sample...
204
click to vote
JUCS
2010
15 years 4 months ago
2010
Abstract: This paper addresses the problem of expressing preferences among nonfunctional properties of services in a Web service architecture. In such a context, semantic and non-f...
148
click to vote
JUCS
2010
15 years 4 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
197
click to vote
KDD
2010
ACM
15 years 4 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
191
click to vote
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...