4911 search results - page 179 / 983 » Tree dependence analysis |
114
Voted
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
112
click to vote
IWMM
2000
Springer
15 years 6 months ago
2000
Springer
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. The existing fault-tolerance of Piquer's Indirect Referen...
123
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
117
click to vote
DIS
2008
Springer
15 years 4 months ago
2008
Springer
We consider learning tasks where multiple target variables need to be predicted. Two approaches have been used in this setting: (a) build a separate single-target model for each ta...
155
click to vote
SAC
2011
ACM
14 years 6 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...