1000 search results - page 105 / 200 » Dependency Tree Automata |
120
click to vote
APWEB
2004
Springer
15 years 6 months ago
2004
Springer
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...
IFIP
2004
Springer
15 years 6 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...
IWMM
2000
Springer
15 years 4 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...
105
click to vote
SODA
2004
ACM
15 years 2 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 ...
DIS
2008
Springer
15 years 1 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...