4095 search results - page 169 / 819 » How to test a tree |
114
click to vote
WDAG
2007
Springer
15 years 6 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
115
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
114
Voted
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...
113
Voted
INFOCOM
1999
IEEE
15 years 4 months ago
1999
IEEE
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
122
click to vote
DAC
1989
ACM
15 years 4 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...