625 search results - page 63 / 125 » Routing in Trees |
HIPC
2003
Springer
14 years 3 months ago
2003
Springer
Abstract: Overlay Multicast networks in mobile ad-hoc environments have received much attention due to their increasing number of practical applications. Although overlay multicast...
ICASSP
2009
IEEE
14 years 4 months ago
2009
IEEE
This work presents a class of unidirectional lifting-based wavelet transforms for an arbitrary communication graph in a wireless sensor network. These transforms are unidirectiona...
APPROX
2004
Springer
14 years 3 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
DAC
2009
ACM
14 years 11 months ago
2009
ACM
In this work, we present a new optical routing framework, O-Router for future low-power on-chip optical interconnect integration utilizing silicon compatible nano-photonic devices...
ISCAS
2005
IEEE
14 years 3 months ago
2005
IEEE
— The 3-D channel routing is a fundamental problem on the physical design of 3-D integrated circuits. The 3-D channel is a 3-D grid G and the terminals are vertices of G located ...