Sciweavers

2314 search results - page 272 / 463
» Minimal Partitions of a Graph
Sort
View
INFOCOM
2012
IEEE
13 years 6 months ago
Robust topology control in multi-hop cognitive radio networks
—The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance m...
Jing Zhao, Guohong Cao
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
15 years 10 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
SOFTVIS
2003
ACM
15 years 9 months ago
A New Approach for Visualizing UML Class Diagrams
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...
Carsten Gutwenger, Michael Jünger, Karsten Kl...
SCALESPACE
2009
Springer
15 years 8 months ago
Semi-supervised Segmentation Based on Non-local Continuous Min-Cut
We propose a semi-supervised image segmentation method that relies on a non-local continuous version of the min-cut algorithm and labels or seeds provided by a user. The segmentati...
Nawal Houhou, Xavier Bresson, Arthur Szlam, Tony F...
IS
2008
15 years 4 months ago
Clustering spatial networks for aggregate query processing: A hypergraph approach
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query proce...
Engin Demir, Cevdet Aykanat, Berkant Barla Cambazo...