474 search results - page 34 / 95 » On Multicast Path Finding Algorithms |
ICOIN
2001
Springer
14 years 4 days ago
2001
Springer
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path-patt...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they d...
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
ACL
2004
13 years 9 months ago
2004
This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the be...