2492 search results - page 236 / 499 » False-Name-Proofness in Social Networks |
216
click to vote
KDD
2004
ACM
16 years 20 hour ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
219
Voted
PERCOM
2010
ACM
15 years 5 months ago
2010
ACM
—Mobile devices are becoming the largest sensor network around the world. They could be used to collect a large amount of data with little effort and cost which is leading to a p...
202
click to vote
KAIS
2011
15 years 1 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
209
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
160
click to vote
CASON
2009
IEEE
16 years 1 months ago
2009
IEEE
We present in this paper a drawing algorithm to represent graphically co-citation networks (scientograms). These networks have some interesting and unusual topological properties ...