1664 search results - page 134 / 333 » Distance labeling in graphs |
150
Voted
FOCS
1995
IEEE
15 years 9 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
126
click to vote
IPL
2010
15 years 4 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
182
Voted
GC
2011
Springer
14 years 9 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
173
click to vote
MMSP
2008
IEEE
16 years 16 days ago
2008
IEEE
—In this paper, we propose a framework to extend semantic labeling of images to video shot sequences and achieve efficient and semantic-aware spatiotemporal video segmentation. ...
189
Voted
CVPR
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a novel approach to inferring 3D volumetric shape of both moving objects and static background from video sequences shot by a moving camera, with the assumption that th...