2100 search results - page 50 / 420 » Learning to rank on graphs |
CAV
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
112
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
This paper is concerned with rank aggregation, the task of combining the ranking results of individual rankers at meta-search. Previously, rank aggregation was performed mainly by...
111
click to vote
WAW
2004
Springer
15 years 7 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
122
click to vote
FAW
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
117
click to vote
EJC
2008
15 years 2 months ago
2008
A partial linear space is a non-empty set of points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every lin...