1528 search results - page 104 / 306 » On Signatures for Communication Graphs |
108
click to vote
GLOBECOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
158
click to vote
IM
2008
15 years 5 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
118
Voted
JGAA
2007
15 years 5 months ago
2007
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
116
click to vote
SAC
2006
ACM
15 years 11 months ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
160
click to vote
ESAS
2006
Springer
15 years 8 months ago
2006
Springer
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n ...