30 search results - page 2 / 6 » K-Trunk and Efficient Algorithms for Finding a K-Trunk on a ... |
IJPP
2008
13 years 5 months ago
2008
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
COMCOM
2006
13 years 5 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
ICDM
2010
IEEE
13 years 3 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
DEXA
2010
Springer
13 years 5 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...