513 search results - page 54 / 103 » Soft Edge Coloring |
101
Voted
NETWORKS
2010
14 years 11 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
108
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We propose a methodology for improved segmentation of images in a Bayesian framework by fusion of color, texture and gradient information. The proposed algorithm is initialized by...
115
click to vote
SAT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
104
click to vote
DATE
2002
IEEE
15 years 5 months ago
2002
IEEE
Optimizing power consumption at high-level is a critical step towards power-efficient digital system designs. This paper addresses the power management problem by scheduling a giv...
83
Voted
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
This paper describes an algorithm for the extraction of multiple regions using multiple active contour models (ACMs). The algorithm organizes edge points into strokes and assigns ...