1493 search results - page 67 / 299 » Local resilience of graphs |
113
Voted
CN
2008
15 years 21 days ago
2008
Proxy caching servers are widely deployed in today's Internet. While cooperation among proxy caches can significantly improve a network's resilience to denial-ofservice ...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
107
Voted
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
123
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
111
Voted
ICIP
2008
IEEE
16 years 2 months ago
2008
IEEE
This paper presents a distributed and occlusion-robust coding scheme for multi-view omnidirectional images, which relies on the geometry of the 3D scene. The Wyner-Ziv coder uses ...