Sciweavers

1493 search results - page 17 / 299
» Local resilience of graphs
Sort
View
MOBIHOC
2005
ACM
14 years 7 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
ICPR
2008
IEEE
14 years 8 months ago
Object localization using affine invariant substructure constraints
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
Ahmed M. Elgammal, Ishani Chakraborty
RSA
2010
108views more  RSA 2010»
13 years 6 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
DM
2002
89views more  DM 2002»
13 years 7 months ago
Fibrations of graphs
A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. This pap...
Paolo Boldi, Sebastiano Vigna
IV
2007
IEEE
105views Visualization» more  IV 2007»
14 years 1 months ago
Mapping a Local Web Domain
In this study, we crawled a local Web domain, created its graph representation, and analyzed the network structure. The results of network analysis revealed local scalefree patter...
Weimao Ke, Tiago Simas