1591 search results - page 111 / 319 » Random lifts of graphs |
156
click to vote
MOBIQUITOUS
2007
IEEE
16 years 19 days ago
2007
IEEE
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
159
click to vote
OPODIS
2008
15 years 7 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
165
click to vote
PEPM
2010
ACM
16 years 3 months ago
2010
ACM
Pushdown systems are well understood as abstract models of programs with (recursive) procedures. Reps et al. recently extended pushdown systems into weighted pushdown systems, whi...
160
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
169
click to vote
AVI
2006
15 years 7 months ago
2006
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...