75 citations · 210 across the 10 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CV2016
Efficient Optimization for Rank-based Loss Functions
Pritish Mohapatra, Michal Rolinek, C. V. Jawahar +2
The accuracy of information retrieval systems is often measured using complex loss functions such as the average precision (AP) or the normalized discounted cumulative gain (NDCG).…
cs.CC2016
Even Delta-Matroids and the Complexity of Planar Boolean CSPs
Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek
The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each vari…