Sciweavers

515 search results - page 91 / 103
» Automated Social Network Analysis for Collaborative Work
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 9 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
MSWIM
2009
ACM
14 years 2 months ago
A performance evaluation framework for fair solutions in ad hoc networks
Fairness in multihop ad hoc networks has received considerable attention in the literature. Many schemes have been proposed, which attempt to compute the “optimal” bit rates o...
Manos Dramitinos, Rémi Vannier, Isabelle Gu...
IJMMS
2007
166views more  IJMMS 2007»
13 years 7 months ago
Visualization of large networks with min-cut plots, A-plots and R-MAT
What does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital f...
Deepayan Chakrabarti, Christos Faloutsos, Yiping Z...
CONEXT
2009
ACM
13 years 8 months ago
ThunderDome: discovering upload constraints using decentralized bandwidth tournaments
ThunderDome is a system for collaboratively measuring upload bandwidths in ad-hoc peer-to-peer systems. It works by scheduling bandwidth probes between pairs of hosts, wherein eac...
John R. Douceur, James W. Mickens, Thomas Moscibro...
CORR
2012
Springer
250views Education» more  CORR 2012»
12 years 3 months ago
Mining Attribute-structure Correlated Patterns in Large Attributed Graphs
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...
Arlei Silva, Wagner Meira Jr., Mohammed J. Zaki