Sciweavers

856 search results - page 138 / 172
» On Randomness Measures for Social Networks.
Sort
View
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
16 years 5 days ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
ATAL
2006
Springer
15 years 9 months ago
Learning a common language through an emergent interaction topology
We study the effects of various emergent topologies of interaction on the rate of language convergence in a population of communicating agents. The agents generate, parse, and lea...
Samarth Swarup, Kiran Lakkaraju, Les Gasser
176
Voted
ESOA
2006
15 years 9 months ago
Greedy Cheating Liars and the Fools Who Believe Them
Evolutionary algorithms based on "tags" can be adapted to induce cooperation in selfish environments such as peer-to-peer systems. In this approach, nodes periodically co...
Stefano Arteconi, David Hales, Özalp Babaoglu
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
16 years 21 days ago
Orca Reduction and ContrAction Graph Clustering
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
Daniel Delling, Robert Görke, Christian Schul...
ICWSM
2008
15 years 7 months ago
Competing to Share Expertise: The Taskcn Knowledge Sharing Community
"Witkeys" are websites in China that form a rapidly growing web-based knowledge market. A user who posts a task also offers a small fee, and many other users submit thei...
Jiang Yang, Lada A. Adamic, Mark S. Ackerman