Sciweavers

1493 search results - page 21 / 299
» Local resilience of graphs
Sort
View
CCCG
2008
13 years 9 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
ICIP
2010
IEEE
13 years 5 months ago
Local two-channel critically sampled filter-banks on graphs
In this paper, we propose two-channel filter-bank designs for signals defined on arbitrary graphs. These filter-banks are local, invertible and critically sampled. Depending on th...
Sunil K. Narang, Antonio Ortega
OPODIS
2004
13 years 9 months ago
Comparison of Failures and Attacks on Random and Scale-Free Networks
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
Jean-Loup Guillaume, Matthieu Latapy, Cléme...
GBRPR
2007
Springer
14 years 1 months ago
Local Reasoning in Fuzzy Attribute Graphs for Optimizing Sequential Segmentation
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics. Graphs are...
Geoffroy Fouquier, Jamal Atif, Isabelle Bloch
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...