483 search results - page 32 / 97 » Linear Ranking with Reachability |
CORR
2006
Springer
13 years 10 months ago
2006
Springer
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Using this new concept, we derive proper...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
SCIA
2009
Springer
14 years 4 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
SIAMSC
2008
13 years 10 months ago
2008
A multilevel adaptive aggregation method for calculating the stationary probability vector of an irreducible stochastic matrix is described. The method is a special case of the ada...
ESSMAC
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...