552 search results - page 54 / 111 » Constrained Shortest Path Computation |
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
In order to analyze shapes of continuous curves in R3 , we parameterize them by arc-length and represent them as curves on a unit two-sphere. We identify the subset denoting the cl...
102
click to vote
CAD
2004
Springer
14 years 9 months ago
2004
Springer
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
ICPP
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
PODC
2006
ACM
15 years 3 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...