72 citations · 320 across the 36 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.IR2021★ 3 cited
An Optimal Algorithm for Finding Champions in Tournament Graphs
Lorenzo Beretta, Franco Maria Nardini, Roberto Trani +1
A tournament graph is a complete directed graph, which can be used to model a round-robin tournament between players. In this paper, we address the problem of finding a champio…
cs.IR2021
Learning Early Exit Strategies for Additive Ranking Ensembles
Francesco Busolin, Claudio Lucchese, Franco Maria Nardini +3
Modern search engine ranking pipelines are commonly based on large machine-learned ensembles of regression trees. We propose LEAR, a novel - learned - technique aimed to reduce the…