Sciweavers

745 search results - page 47 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
AVI
2006
15 years 7 months ago
Just how dense are dense graphs in the real world?: a methodological note
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...
Guy Melançon
CAAN
2004
Springer
15 years 11 months ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy
IBPRIA
2003
Springer
15 years 11 months ago
Segmentation of Curvilinear Objects Using a~Watershed-Based Curve Adjacency Graph
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
Thierry Géraud
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
15 years 11 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
IPPS
2006
IEEE
16 years 3 hour ago
Fault and intrusion tolerance of wireless sensor networks
The following three questions should be answered in developing new topology with more powerful ability to tolerate node-failure in wireless sensor network. First, what is node-fai...
Liang-min Wang, Jianfeng Ma, Chao Wang, A. C. Kot