2773 search results - page 335 / 555 » Decomposing Social Networks |
170
click to vote
MLG
2007
Springer
16 years 23 days ago
2007
Springer
: Network topology not only tells about tightly-connected “communities,” but also gives cues on more subtle properties of the vertices. We introduce a simple probabilistic late...
153
click to vote
INFOCOM
2006
IEEE
16 years 19 days ago
2006
IEEE
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
159
click to vote
AI
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. This paper explores potential improvements to Zhang’s personalized trust approach for e-commerce, in particular examining means of optimizing the number of advisors tha...
193
click to vote
JSAC
2007
15 years 6 months ago
2007
— In communication networks, such as the Internet or mobile ad-hoc networks, the actions taken by intermediate nodes or links are typically hidden from the communicating endpoint...
177
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...