570 search results - page 34 / 114 » Edge Coloring with Delays |
SOCIALCOM
2010
14 years 9 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...
CN
2006
14 years 12 months ago
2006
Expedited Forwarding (EF) is a service defined under the Differentiated Services framework. Based on its recently revised definition in IETF RFC 3246, Packet Scale Rate Guarantee ...
FGR
2004
IEEE
15 years 3 months ago
2004
IEEE
We present a lip contour extraction method using separability of color intensity distributions. Usually it is difficult to robustly extract the outer lip contour mainly because of...
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
The choice of a color space is of great importance for many computer vision algorithms (e.g. edge detection and object recognition). It induces the equivalence classes to the actu...
100
click to vote
ESA
2006
Springer
15 years 3 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...