511 search results - page 41 / 103 » TSP with bounded metrics |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
103
click to vote
IJCAI
2007
14 years 11 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
74
Voted
PAMI
1998
14 years 9 months ago
1998
—Deformable template representations of observed imagery, model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we stud...
ICCV
2009
IEEE
14 years 7 months ago
2009
IEEE
The varying object appearance and unlabeled data from new frames are always the challenging problem in object tracking. Recently machine learning methods are widely applied to tra...
105
click to vote
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...