2018 search results - page 85 / 404 » Magnitude-preserving ranking algorithms |
142
click to vote
ESA
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
156
Voted
AAAI
2006
15 years 7 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
189
Voted
WWW
2007
ACM
16 years 6 months ago
2007
ACM
Information flows in a network where individuals influence each other. The diffusion rate captures how efficiently the information can diffuse among the users in the network. We p...
168
click to vote
ECIR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We implemented a baseline approach to why-question answering based on paragraph retrieval. Our implementation incorporates the QAP ranking algorithm with addition of a nu...
161
Voted
COCOON
2009
Springer
16 years 22 days ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...