12194 search results - page 34 / 2439 » Numberings Optimal for Learning |
219
click to vote
MLQ
2011
14 years 10 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...
150
click to vote
GECCO
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we study the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) with different numbers of interpolation points. NEWUOA is a trust region method, ...
149
Voted
ACML
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
ALT
1993
Springer
15 years 7 months ago
1993
Springer
