194 search results - page 9 / 39 » Computing Roundness is Easy if the Set is Almost Round |
121
Voted
LATIN
2010
Springer
15 years 9 days 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...
100
Voted
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
A new algorithm for performing classification with imperfectly labeled data is presented. The proposed approach is motivated by the insight that the average prediction of a group ...
110
Voted
PDCAT
2005
Springer
15 years 7 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
102
Voted
COLT
2005
Springer
15 years 7 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
140
click to vote
ICML
1999
IEEE
16 years 2 months ago
1999
IEEE
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...