1798 search results - page 52 / 360 » A Tree for All Seasons |
SWAT
2004
Springer
14 years 2 months ago
2004
Springer
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
INFOCOM
1999
IEEE
14 years 1 months ago
1999
IEEE
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth res...
CISSE
2008
Springer
13 years 10 months ago
2008
Springer
This paper studies a tuned version of an induction tree which is used for automatic detection of lexical word category. The database used to train the tree has several fields to de...
HICSS
2008
IEEE
13 years 9 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
IPL
2007
13 years 8 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...