26 search results - page 1 / 6 » L-functions for images of graph coverings by some operations |
DM
2002
13 years 5 months ago
2002
ISMM
2009
Springer
13 years 11 months ago
2009
Springer
We study some basic morphological operators acting on the lattice of all subgraphs of a (non-weighted) graph G. To this end, we consider two dual adjunctions between the edge set a...
ICIAP
2009
ACM
13 years 2 months ago
2009
ACM
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
ICITS
2011
12 years 8 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
DAGM
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...