Sciweavers

1749 search results - page 97 / 350
» Conditional colorings of graphs
Sort
View
ICB
2007
Springer
188views Biometrics» more  ICB 2007»
15 years 8 months ago
Color Face Tensor Factorization and Slicing for Illumination-Robust Recognition
In this paper we present a face recognition method based on multiway analysis of color face images, which is robust to varying illumination conditions. Illumination changes cause l...
Yong-Deok Kim, Seungjin Choi
EJC
2010
15 years 6 months ago
Shilla distance-regular graphs
A Shilla distance-regular graph (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divide...
Jack H. Koolen, Jongyook Park
IJCAI
2007
15 years 7 months ago
Color Learning on a Mobile Robot: Towards Full Autonomy under Changing Illumination
A central goal of robotics and AI is to be able to deploy an agent to act autonomously in the real world over an extended period of time. It is commonly asserted that in order to ...
Mohan Sridharan, Peter Stone
FOCS
2003
IEEE
15 years 11 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
COMBINATORICS
2006
89views more  COMBINATORICS 2006»
15 years 6 months ago
Rainbow H-factors
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
Raphael Yuster