513 search results - page 44 / 103 » Soft Edge Coloring |
96
Voted
COMBINATORICS
2000
15 years 10 days ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
100
Voted
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
In this paper, a new anisotropic diffusion noise filtering technique is proposed. The technique has two specific features: it is designed for vector-valued images in general and f...
ICIP
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper we propose a novel computational method to infer visual saliency in images. The computational method is based on the idea that salient objects should have local char...
97
Voted
ARSCOM
1998
15 years 7 days ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
111
Voted
WSCG
2004
15 years 1 months ago
2004
The problem of segmenting color video sequences is addressed. Boundary motion and occlusion relations expressed by labeling rules are argued to be of key importance for segmentati...