1772 search results - page 126 / 355 » Classifying Problems into Complexity Classes |
186
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
166
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
171
click to vote
ADBIS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
172
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
The selection of weak classifiers is critical to the success of boosting techniques. Poor weak classifiers do not perform better than random guess, thus cannot help decrease the t...
169
click to vote
JMLR
2008
15 years 6 months ago
2008
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...