446 search results - page 36 / 90 » A fast algorithm for computing steiner edge connectivity |
70
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of traffic on one or m...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
CVPR
2010
IEEE
14 years 10 months ago
2010
IEEE
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
93
Voted
WEA
2010
Springer
15 years 4 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
BROADNETS
2004
IEEE
15 years 1 months ago
2004
IEEE
In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call...