565 search results - page 2 / 113 » Colorization by Matrix Completion |
JCT
2008
13 years 5 months ago
2008
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at ran...
ICPR
2008
IEEE
13 years 12 months ago
2008
IEEE
This paper presents a novel color face recognition approach based on 2DPCA. A matrix-representation model, which encodes the color information directly, is proposed to describe th...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...