1493 search results - page 95 / 299 » Local resilience of graphs |
107
Voted
AAAI
2008
15 years 3 months ago
2008
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...
81
Voted
DAM
2008
15 years 23 days ago
2008
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...
89
Voted
IPL
2008
15 years 20 days ago
2008
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�...
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
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...
113
click to vote
ICIAP
2003
ACM
16 years 24 days 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...