1441 search results - page 51 / 289 » Multiple instance ranking |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We propose a mid-level image segmentation framework that combines multiple figure-ground hypothesis (FG) constrained at different locations and scales, into interpretations that t...
IPPS
2009
IEEE
14 years 4 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
AAAI
2007
14 years 5 days ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
MFCS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...