628 search results - page 63 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
121
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
221
click to vote
CORR
2010
Springer
15 years 17 days ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
157
click to vote
AINA
2005
IEEE
15 years 8 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
148
click to vote
WWW
2007
ACM
16 years 3 months ago
2007
ACM
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...