Sciweavers

760 search results - page 126 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
TIP
2010
129views more  TIP 2010»
13 years 2 months ago
Image Segmentation by MAP-ML Estimations
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
Shifeng Chen, Liangliang Cao, Yueming Wang, Jianzh...
COMCOM
2006
100views more  COMCOM 2006»
13 years 7 months ago
Routing and wavelength assignment for core-based tree in WDM networks
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
Jianping Wang, Xiangtong Qi, Mei Yang
COMBINATORICS
2004
115views more  COMBINATORICS 2004»
13 years 7 months ago
Dense Packings of Equal Spheres in a Cube
We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this...
Thierry Gensane
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 7 months ago
Message-passing for Maximum Weight Independent Set
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...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 7 months ago
Theory of Rumour Spreading in Complex Social Networks
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
Maziar Nekovee, Yamir Moreno, G. Bianconi, M. Mars...