513 search results - page 27 / 103 » Soft Edge Coloring |
99
Voted
DM
2008
15 years 16 days ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
112
Voted
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
Abstract-- This paper presents a novel approach using combined features to retrieve images containing specific objects, scenes or buildings. The content of an image is characterize...
132
Voted
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
110
Voted
WEA
2007
Springer
15 years 6 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
121
Voted
BILDMED
2006
15 years 1 months ago
2006
This paper presents a new approach to automated muscle fiber analysis based on segmenting myofibers with combined region and edge based active contours. It provides reliable and fu...