101 citations · 355 across the 29 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016★ 16 cited
A Faster Approximation Algorithm for the Gibbs Partition Function
Vladimir Kolmogorov
We consider the problem of estimating the partition function of a Gibbs distribution with a Hamilton , or more precisely the logarithm of the…
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…