565 search results - page 46 / 113 » Colorization by Matrix Completion |
125
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
SIAMDM
2008
15 years 1 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
142
click to vote
CSIE
2009
IEEE
15 years 8 months ago
2009
IEEE
The paper presents an evaluation of four clustering algorithms: k-means, average linkage, complete linkage, and Ward’s method, with the latter three being different hierarchical...
104
click to vote
CGO
2007
IEEE
15 years 8 months ago
2007
IEEE
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
126
click to vote
WG
2001
Springer
15 years 6 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...