Sciweavers

570 search results - page 57 / 114
» Edge Coloring with Delays
Sort
View
VCIP
2003
170views Communications» more  VCIP 2003»
15 years 1 months ago
How good are the visual MPEG-7 features?
The study presented in this paper analyses descriptions extracted with MPEG-7-descriptors from visual content from the statistical point of view. Good descriptors should generate ...
Horst Eidenberger
JGT
2010
90views more  JGT 2010»
14 years 10 months ago
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
Michael Krivelevich, Raphael Yuster
JCO
2011
113views more  JCO 2011»
14 years 6 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
PAM
2004
Springer
15 years 5 months ago
Origins of Microcongestion in an Access Router
Using an authoritative data set from a fully instrumented router at the edge of a core network, packet delays through an access link are studied in detail. Three different root ca...
Konstantina Papagiannaki, Darryl Veitch, Nicolas H...
TCAD
2010
194views more  TCAD 2010»
14 years 6 months ago
Layout Decomposition Approaches for Double Patterning Lithography
Abstract--In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different ex...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...