Sciweavers

4324 search results - page 649 / 865
» Online social networks
Sort
View
120
Voted
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 6 months 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...
135
Voted
SIGMETRICS
2010
ACM
193views Hardware» more  SIGMETRICS 2010»
15 years 2 months ago
Distributed caching over heterogeneous mobile networks
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a lo...
Stratis Ioannidis, Laurent Massoulié, Augus...
WIOPT
2010
IEEE
15 years 5 days ago
Competitive interference-aware spectrum access in cognitive radio networks
—Cognitive radio networks provide the capability to share the wireless channel with licensed (primary) users in an opportunistic manner. Primary users have a license to operate i...
Jocelyne Elias, Fabio Martignon, Antonio Capone, E...
PIMRC
2010
IEEE
14 years 11 months ago
Contact surround in opportunistic networks
Abstract--Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant re...
Nadjet Belblidia, Marcelo Dias de Amorim, Jeremie ...
WWW
2010
ACM
15 years 8 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney