1498 search results - page 40 / 300 » Collection tree protocol |
RECOMB
2012
Springer
12 years 13 days ago
2012
Springer
Signaling networks are essential for cells to control processes such as growth and response to stimuli. Although many “omic” data sources are available to probe signaling pathw...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
SWAT
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
ICSE
2007
IEEE-ACM
14 years 10 months ago
2007
IEEE-ACM
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...