12194 search results - page 34 / 2439 » Numberings Optimal for Learning |
188
Voted
MLQ
2011
14 years 7 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...
122
Voted
GECCO
2010
Springer
15 years 19 days 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, ...
116
click to vote
ACML
2009
Springer
15 years 4 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...
98
Voted
COLT
2007
Springer
15 years 6 months ago
2007
Springer
71
Voted
ALT
1993
Springer
15 years 4 months ago
1993
Springer
