Inspite extensive research on visual tracking of multiple people in computer vision area, the robustness and usability of visual trackers are still discouraging. Recently, a few l...
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...
This paper presents an algorithm for multiscale image segmentation. Towards this, it proposes a new region model, that of a homogenous region surrounded by ramp discontinuities (a...
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...