599 search results - page 13 / 120 » The repeater tree construction problem |
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
Hierarchies are an intuitive and effective organization paradigm for data. Of late there has been considerable research on automatically learning hierarchical organizations of dat...
EUROPAR
2007
Springer
15 years 3 months ago
2007
Springer
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
104
click to vote
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
106
click to vote
ACPC
1999
Springer
15 years 1 months ago
1999
Springer
Multi-resolution methods are widely used in scientific visualization, image processing, and computer graphics. While many applications only require an one-time construction of the...
SIAMCOMP
2000
14 years 9 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...