625 search results - page 60 / 125 » Semi-preemptive routing on trees |
113
Voted
TCAD
2008
15 years 13 days ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
88
Voted
APPROX
2004
Springer
15 years 6 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...
ICPP
1994
IEEE
15 years 4 months ago
1994
IEEE
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
118
Voted
ICASSP
2010
IEEE
14 years 11 months ago
2010
IEEE
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
122
click to vote
TMC
2012
13 years 2 months ago
2012
—This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative r...