513 search results - page 39 / 103 » Soft Edge Coloring |
98
Voted
WAOA
2005
Springer
15 years 6 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
118
click to vote
CGF
2006
15 years 16 days ago
2006
Shadows, particularly soft shadows, play an important role in the visual perception of a scene by providing visual cues about the shape and position of objects. Several recent alg...
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
The aim of color constancy is to remove the effect of the
color of the light source. As color constancy is inherently
an ill-posed problem, most of the existing color constancy
...
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
SOCIALCOM
2010
14 years 10 months ago
2010
: Networks having several hundred or more nodes and significant edge probabilities are extremely difficult to visualize. They typically appear as dense clumps, with the various sub...