Sciweavers

1493 search results - page 95 / 299
» Local resilience of graphs
Sort
View
AAAI
2008
13 years 10 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
DAM
2008
102views more  DAM 2008»
13 years 8 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
IPL
2008
145views more  IPL 2008»
13 years 7 months ago
Complexity analysis of a decentralised graph colouring algorithm
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov
ICPR
2006
IEEE
14 years 9 months ago
Combinatorial Surface Integration
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
Edwin R. Hancock, Roberto Fraile
ICIAP
2003
ACM
14 years 8 months ago
A feature-based face recognition system
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