31 search results - page 6 / 7 » Two fixed-parameter algorithms for Vertex Covering by Paths ... |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
FCT
2003
Springer
14 years 18 days ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
SIAMDM
2008
13 years 7 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper proposes a new tracking algorithm within a 3D-SLAM framework that takes segmented range images as observations. The framework has two layers: the local layer tracks ...