856 search results - page 59 / 172 » On Randomness Measures for Social Networks. |
164
click to vote
CIKM
2009
Springer
16 years 26 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...
170
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract: Transactional network data can be thought of as a list of oneto-many communications (e.g., email) between nodes in a social network. Most social network models convert th...
180
click to vote
MWCN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract This paper investigates the performance of a multihop radio access network. In our testbed, nodes communicate to one access point using IEEE 802.11b and AODV routing. We m...
204
click to vote
MSWIM
2003
ACM
15 years 11 months ago
2003
ACM
Mobile Ad-Hoc Networks (MANETS) are networks of mobile nodes that do not have a fixed infrastructure. Recent research in this field addresses ways of solving existing problems i...
177
click to vote
MIR
2010
ACM
15 years 8 months ago
2010
ACM
Multimedia ranking algorithms are usually user-neutral and measure the importance and relevance of documents by only using the visual contents and meta-data. However, users’ int...