Sciweavers

425 search results - page 40 / 85
» Path Coloring on the Mesh
Sort
View
GLVLSI
2010
IEEE
171views VLSI» more  GLVLSI 2010»
15 years 7 months ago
Timing-driven variation-aware nonuniform clock mesh synthesis
Clock skew variations adversely affect timing margins, limiting performance, reducing yield, and may also lead to functional faults. Non-tree clock distribution networks, such as ...
Ameer Abdelhadi, Ran Ginosar, Avinoam Kolodny, Eby...
101
Voted
JGT
2010
90views more  JGT 2010»
15 years 10 days 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
TIP
2010
176views more  TIP 2010»
14 years 8 months ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert
MOBICOM
2004
ACM
15 years 7 months ago
Routing in multi-radio, multi-hop wireless mesh networks
We present a new protocol for routing in multi-radio, multi-hop wireless networks. Our protocol, Multi-Radio Link-Quality Source Routing, is designed for wireless networks with st...
Richard Draves, Jitendra Padhye, Brian Zill
COCOON
2006
Springer
15 years 5 months ago
Optimal Acyclic Edge Colouring of Grid Like Graphs
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
Rahul Muthu, N. Narayanan, C. R. Subramanian