856 search results - page 60 / 172 » On Randomness Measures for Social Networks. |
162
click to vote
ICWSM
2008
15 years 7 months ago
2008
We study here Flickr groups in order to see whether they are actual communities or rather essentially thematic clusters. We describe a methodological framework for the analysis of...
154
click to vote
JSAC
2010
15 years 4 months ago
2010
—Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, c...
171
click to vote
ISCIS
2005
Springer
15 years 11 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
185
click to vote
JSAC
2008
15 years 6 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
133
click to vote
CIKM
2009
Springer
16 years 26 days ago
2009
Springer
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...