356 search results - page 64 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
CVPR
2005
IEEE
13 years 9 months ago
2005
IEEE
We address the normal reconstruction problem by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint. Our method is robust to spurio...
UAI
2003
13 years 9 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
ICCV
2009
IEEE
15 years 15 days ago
2009
IEEE
In this paper we propose a robust visual tracking method
by casting tracking as a sparse approximation problem in a
particle filter framework. In this framework, occlusion, corru...