801 search results - page 52 / 161 » Minimal Locked Trees |
171
click to vote
DAC
1995
ACM
15 years 9 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
156
click to vote
FINTAL
2006
15 years 10 months ago
2006
Abstract. Discourse segmentation is the division of a text into minimal discourse segments, which form the leaves in the trees that are used to represent discourse structures. A de...
150
click to vote
ICMCS
2006
IEEE
16 years 9 days ago
2006
IEEE
In traditional overlay multicast network, all peers are treated as equal regardless of their importance and contribution to the network. In this paper, we consider that each user ...
168
click to vote
IPCCC
2006
IEEE
16 years 9 days ago
2006
IEEE
— This paper presents an investment strategy to reduce the risk associated with failures in Wavelength Division Multiplexing (WDM) optical networks. The investment strategy deter...
186
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...