2018 search results - page 48 / 404 » Magnitude-preserving ranking algorithms |
ADHOCNOW
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We propose simple and efficient sorting algorithm for unreliable single hop radio network. (In such network each listening station
SIAMCOMP
2010
14 years 4 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
101
click to vote
IWOCA
2010
Springer
14 years 4 months ago
2010
Springer
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...