830 search results - page 9 / 166 » Route kernels for trees |
103
click to vote
WSS
1997
15 years 1 months ago
1997
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
95
Voted
ISCC
2000
IEEE
15 years 4 months ago
2000
IEEE
In this paper, we propose a new Tree Switching Protocol (TSP) to reduce multicast routing states required for a forest of multicast trees. The protocol accomplishes this goal by s...
118
Voted
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
108
Voted
ICML
2006
IEEE
16 years 14 days ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
102
Voted
CN
2007
14 years 11 months ago
2007
- One of the key design issues for IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a lon...