474 search results - page 16 / 95 » On Multicast Path Finding Algorithms |
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
CAD
2004
Springer
13 years 7 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 ...
EMMCVPR
2001
Springer
14 years 4 days ago
2001
Springer
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...
IWANN
1997
Springer
13 years 11 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
AINTEC
2006
Springer
13 years 11 months ago
2006
Springer
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...