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 ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
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 ...
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...
Paola Campadelli, Raffaella Lanzarotti, C. Savazzi
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...
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...