565 search results - page 58 / 113 » Colorization by Matrix Completion |
159
Voted
EJC
2007
15 years 6 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
151
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
179
click to vote
ICIAP
2003
ACM
16 years 6 months ago
2003
ACM
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determine...
133
click to vote
ICMCS
2007
IEEE
16 years 21 days ago
2007
IEEE
Recently great interest has been shown in the visual surveillance of public transportation systems. The challenge is the automated analysis of passenger’s behaviors with a set o...
170
click to vote
AC
2003
Springer
15 years 11 months ago
2003
Springer
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determines...