745 search results - page 87 / 149 » On Generating Random Network Structures: Connected Graphs |
160
click to vote
ASUNAM
2009
IEEE
16 years 29 days ago
2009
IEEE
—This paper presents a novel methodology for social network discovery based on the sensitivity coefficients of importance metrics, namely the Markov centrality of a node, a metr...
178
Voted
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
—There is increasing interest in analyzing networks of all types including social, biological, sensor, computer, and transportation networks. Broadly speaking, we may be interest...
165
Voted
COMPLEX
2009
Springer
16 years 22 days ago
2009
Springer
We derive variational equations to analyze the stability of synchronization for coupled near-identical oscillators. To study the effect of parameter mismatch on the stability in a ...
168
click to vote
PET
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...
162
click to vote
CIKM
2009
Springer
16 years 22 days ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...