Search Results for author:
Found 3 papers, 0 papers with code
How to aggregate Top-lists: Approximation algorithms via scores and average ranks
* Using average ranks, we generalize and analyze Borda's algorithm for rank aggregation.
Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?
In this paper, we show optimal worst-case query complexity for the \textsc{max},\textsc{threshold-$v$} and \textsc{Top}-$k$ problems.
Hierarchical Clustering: Objective Functions and Algorithms
For similarity-based hierarchical clustering, Dasgupta showed that the divisive sparsest-cut approach achieves an $O(\log^{3/2} n)$-approximation.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
