2018 search results - page 161 / 404 » Magnitude-preserving ranking algorithms |
155
click to vote
IPCO
2001
15 years 7 months ago
2001
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to ...
142
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...
163
click to vote
NIPS
2003
15 years 7 months ago
2003
The area under an ROC curve (AUC) is a criterion used in many applications to measure the quality of a classification algorithm. However, the objective function optimized in most...
133
click to vote
ANTS
2004
Springer
15 years 11 months ago
2004
Springer
We present an algorithm for the computation of the discrete logarithm in logarithmic -Class Groups. This is applied to the calculation to the -rank of the wild kernel WK2 of a numb...
208
click to vote
ISNN
2004
Springer
15 years 11 months ago
2004
Springer
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...