217 search results - page 26 / 44 » A new upper bound on the cyclic chromatic number |
105
click to vote
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
103
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
107
click to vote
MOBIHOC
2007
ACM
15 years 11 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
126
click to vote
ISMVL
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper proposes a method to represent elementary functions such as trigonometric, logarithmic, square root, and reciprocal functions using edge-valued multi-valued decision di...
105
click to vote
GLVLSI
2002
IEEE
15 years 4 months ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...