982 search results - page 189 / 197 » Solving Steiner tree problems in graphs to optimality |
MIDDLEWARE
2007
Springer
14 years 1 months ago
2007
Springer
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...