Sciweavers

194 search results - page 16 / 39
» Reconstructing Randomized Social Networks
Sort
View
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 8 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
MICS
2010
134views more  MICS 2010»
13 years 6 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
SAC
2008
ACM
13 years 7 months ago
Error estimation in wireless sensor networks
We present an analogy between the operation of a Wireless Sensor Network and the sampling and reconstruction of a signal. We measure the impact of three factors on the quality of ...
Alejandro César Frery, Heitor Ramos, Jos&ea...
JITECH
2010
106views more  JITECH 2010»
13 years 6 months ago
Patterns and structures of intra-organizational learning networks within a knowledge-intensive organization
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
Miha Skerlavaj, Vlado Dimovski, Kevin C. Desouza