513 search results - page 24 / 103 » Soft Edge Coloring |
134
Voted
MMM
2011
Springer
14 years 4 months ago
2011
Springer
As the resolution of output device increases, the demand of high resolution contents has become more eagerly. Therefore, the image superresolution algorithms become more important....
92
Voted
JGT
2007
15 years 10 days ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
81
Voted
DM
2010
15 years 16 days ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
103
click to vote
PICS
2000
15 years 1 months ago
2000
The development and adoption of standards for the evaluation of digital camera resolution has helped foster the widespread use of slanted-edge-based analysis. In addition, the for...
119
Voted
JUCS
2002
15 years 4 days ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...