Sciweavers

1063 search results - page 3 / 213
» A Distributed Hybrid Algorithm for the Graph Coloring Proble...
Sort
View
JGAA
2000
179views more  JGAA 2000»
13 years 4 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
PODC
2010
ACM
13 years 6 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
HYBRID
2010
Springer
13 years 10 months ago
Distributed Kalman Filter algorithms for self-localization of mobile devices
This paper addresses the problem of self localization of mobile devices. In particular, each device combines noisy measurements of its absolute position with distance measurements...
Anne-Kathrin Hess, Anders Rantzer
ICIP
1998
IEEE
14 years 6 months ago
Color Pixels Classification in an Hybrid Color Space
In this paper, we describe a new approach for color image segmentation which is considered as a problem of pixels classification. The algorithm is applied to classify pixels of so...
Jack-Gérard Postaire, Ludovic Macaire, Nico...
DAM
2006
172views more  DAM 2006»
13 years 4 months ago
A Branch-and-Cut algorithm for graph coloring
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
Isabel Méndez-Díaz, Paula Zabala