474 search results - page 47 / 95 » On Multicast Path Finding Algorithms |
HSNMC
2004
Springer
15 years 3 months ago
2004
Springer
We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute t...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
WCET
2010
14 years 7 months ago
2010
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzi...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
101
click to vote
EMMCVPR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...