1493 search results - page 73 / 299 » Local resilience of graphs |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
NIPS
2008
13 years 9 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
AC
2003
Springer
14 years 1 months ago
2003
Springer
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...
ESANN
2001
13 years 9 months ago
2001
Abstract. An approach to symbolic contour extraction will be described that consists of three stages: enhancement, detection, and extraction of edges and corners. Edges and corners...