513 search results - page 10 / 103 » Soft Edge Coloring |
97
Voted
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
105
click to vote
ENDM
2002
15 years 7 days ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
116
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
Edge-based color constancy makes use of image derivatives
to estimate the illuminant. However, different edge
types exist in real-world images such as shadow, geometry,
material...
116
click to vote
INFOCOM
2005
IEEE
15 years 6 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...