830 search results - page 5 / 166 » Route kernels for trees |
133
click to vote
INFOCOM
1997
IEEE
15 years 3 months ago
1997
IEEE
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...
105
click to vote
EUROPAR
2004
Springer
15 years 5 months ago
2004
Springer
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
ICML
2002
IEEE
16 years 14 days ago
2002
IEEE
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-inse...