570 search results - page 41 / 114 » Edge Coloring with Delays |
108
click to vote
PODC
2006
ACM
15 years 5 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...
ASPLOS
2006
ACM
15 years 5 months ago
2006
ACM
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
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...
ARVLSI
1995
IEEE
15 years 3 months ago
1995
IEEE
This paper presents an architecture for generating a high-speed data pattern with precise edge placement resolution by using the matched delay technique. The technique involves ...
108
click to vote
DATE
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we show that under the constant delay model the placement problem is equivalent to minimizing a weighted sum of wire lengths. The weights can be efficiently compute...