565 search results - page 7 / 113 » Colorization by Matrix Completion |
JMLR
2010
13 years 2 months ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A general framework based on Gaussian models and a MAPEM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the sta...
GC
2008
Springer
13 years 7 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE