830 search results - page 13 / 166 » Route kernels for trees |
VLSID
2002
IEEE
16 years 1 days ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
ALGORITHMICA
2008
14 years 11 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
ORL
2010
14 years 10 months ago
2010
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
101
click to vote
EMNLP
2009
14 years 9 months ago
2009
This paper explores the use of innovative kernels based on syntactic and semantic structures for a target relation extraction task. Syntax is derived from constituent and dependen...
ADHOCNOW
2007
Springer
15 years 5 months ago
2007
Springer
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...