455 search results - page 65 / 91 » A local approximation algorithm for maximum weight matching |
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
114
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper, we address the problems of deformable object matching (alignment) and segmentation with cluttered background. We propose a novel hierarchical log-linear model (HLLM...
108
click to vote
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
— We are interested in transferring control policies for arbitrary tasks from a human to a robot. Using interactive demonstration via teloperation as our transfer scenario, we ca...
118
click to vote
APPROX
2010
Springer
15 years 2 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...
140
click to vote
SAC
2003
ACM
15 years 6 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...