1493 search results - page 64 / 299 » Local resilience of graphs |
133
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
148
Voted
WG
2010
Springer
15 years 2 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
120
click to vote
IPL
2000
15 years 4 months ago
2000
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the ro...
153
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
117
click to vote
HOLOMAS
2007
Springer
15 years 10 months ago
2007
Springer
We present a formal approach to conception of a dedicated security infrastructure based on the exception handling in the protected agents. Securityrelated exceptions are identifie...