565 search results - page 9 / 113 » Colorization by Matrix Completion |
JUCS
2006
13 years 7 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
ICCV
2009
IEEE
15 years 14 days ago
2009
IEEE
In this paper we propose an algorithm to estimate missing
values in tensors of visual data. The values can be missing
due to problems in the acquisition process, or because
the ...
ENDM
2002
13 years 7 months ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
DBPL
2007
Springer
14 years 1 months ago
2007
Springer
Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so ...
SETA
2010
Springer
13 years 5 months ago
2010
Springer
A Hadamard matrix is said to be completely non-cyclic (CNC) if there are no two rows (or two columns) that are shift equivalent in its reduced form. In this paper, we present three...