565 search results - page 22 / 113 » Colorization by Matrix Completion |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
IJISTA
2008
13 years 7 months ago
2008
Abstract: Technologies for measuring range data were intensively developed in recent years. The time-of-flight matrix range sensor is one of the most active range acquisition devic...