1173 search results - page 48 / 235 » Ranking functions and rankings on languages |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
107
click to vote
JMLR
2012
13 years 6 days ago
2012
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
COLING
2008
14 years 9 months ago
2008
This paper considers the problem of automatic assessment of local coherence. We present a novel entity-based representation of discourse which is inspired by Centering Theory and ...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Traditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learni...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Many of the recently proposed algorithms for learning feature-based ranking functions are based on the pairwise preference framework, in which instead of taking documents in isola...