We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
A wide range of computer vision applications require an accurate solution of a particular Hamilton-Jacobi (HJ) equation known as the Eikonal equation. In this paper, we propose an ...
Supervised learning of a parts-based model can be for-
mulated as an optimization problem with a large (exponen-
tial in the number of parts) set of constraints. We show how
thi...
M. Pawan Kumar, Andrew Zisserman, Philip H.S. Torr
Edge detection is one of the most studied problems in computer vision, yet it remains a very challenging task. It is difficult since often the decision for an edge cannot be made ...
This paper presents a new algorithm for the problem of robust subspace learning (RSL), i.e., the estimation of linear subspace parameters from a set of data points in the presence...