513 search results - page 45 / 103 » Soft Edge Coloring |
123
click to vote
RSA
2011
14 years 7 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
117
click to vote
PODC
2006
ACM
15 years 6 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
108
Voted
IJIT
2004
15 years 1 months ago
2004
In this paper, we propose a morphing method by which face color images can be freely transformed. The main focus of this work is the transformation of one face image to another. Th...
93
Voted
ICNP
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper examines the use of adaptable priority marking for providing soft bandwidth guarantees to individual connections or connection groups over the Internet. In contrast to ...
105
click to vote
ICIAP
2003
ACM
16 years 19 days ago
2003
ACM
This paper presents a new technique to segment objects of interest from cluttered background with varying edge densities and illumination conditions from gray scale imagery. An op...