565 search results - page 1 / 113 » Colorization by Matrix Completion |
AAAI
2012
11 years 7 months ago
2012
Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a n...
DAM
2002
13 years 4 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
SIAMCOMP
2010
12 years 11 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
JCT
2006
13 years 4 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
CIAC
2010
Springer
13 years 8 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...