535 search results - page 40 / 107 » Generalized Version Space Trees |
124
click to vote
SAC
2011
ACM
14 years 2 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 ...
IPL
2008
14 years 11 months ago
2008
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
WIDM
2004
ACM
15 years 5 months ago
2004
ACM
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
110
click to vote
CIKM
2004
Springer
15 years 5 months ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
VLDB
2004
ACM
15 years 5 months ago
2004
ACM
Moments before the launch of every space vehicle, engineering discipline specialists must make a critical go/no-go decision. The cost of a false positive, allowing a launch in spi...