337 search results - page 34 / 68 » Efficient algorithms for ranking with SVMs |
153
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
188
click to vote
JMLR
2010
15 years 29 days ago
2010
Concentration inequalities that incorporate variance information (such as Bernstein's or Bennett's inequality) are often significantly tighter than counterparts (such as...
136
click to vote
NA
2008
15 years 6 months ago
2008
Stewart's Krylov-Schur algorithm offers two advantages over Sorensen's implicitly restarted Arnoldi (IRA) algorithm. The first is ease of deflation of converged Ritz vect...
145
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
148
click to vote
ICASSP
2008
IEEE
16 years 19 days ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...