253 search results - page 32 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
102
click to vote
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
ICAPR
2005
Springer
15 years 5 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
119
click to vote
SAC
2010
ACM
15 years 6 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...