390 search results - page 48 / 78 » Computing shortest paths for any number of hops |
129
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
121
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
115
click to vote
IANDC
2008
15 years 2 months ago
2008
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
147
click to vote
SIGMETRICS
2006
ACM
15 years 8 months ago
2006
ACM
Despite the existence of several secure BGP routing protocols, there has been little progress to date on actual adoption. Although feasibility for widespread adoption remains the ...
137
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...