In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doy...
In the past, environmental restrictions on size, weight, and power consumption have severely limited both the processing and storage capacity of embedded signal processing systems...
The major problem in building a good lipreading system is to extract effective visual features from enormous quantity of video sequences data. For appearance-based feature analysi...
Yun Fu, Xi Zhou, Ming Liu, Mark Hasegawa-Johnson, ...
This paper discusses the use of spatial graph models for the analysis of networks that do not have a direct spatial reality, such as web graphs, on-line social networks, or citatio...
W e introduce a class of graphs which are variants of the hypercube graph. M a n y of the properties of this class of graphs are similar to that of the hypercube hence, we refer t...
Aniruddha S. Vaidya, P. S. Nagendra Rao, S. Ravi S...