961 search results - page 68 / 193 » Significance-Driven Graph Clustering |
169
click to vote
MOBIHOC
2002
ACM
16 years 3 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
117
Voted
CLOUD
2010
ACM
15 years 9 months ago
2010
ACM
Hermes is an optimization engine for large-scale enterprise e-mail services. Such services could be hosted by a virtualized e-mail service provider, or by dedicated enterprise dat...
111
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Peer-to-Peer (p2p) networks are used for sharing content by millions of users. Often, meta-data used for searching is missing or wrong, making it difficult for users to find cont...
165
click to vote
SOFTVIS
2010
ACM
15 years 2 months ago
2010
ACM
Reverse engineering methods produce different descriptions of software architectures. In this work we analyze and define the task of exploring and comparing these descriptions. ...
168
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Mobile phone data provides rich dynamic information on human activities in social network analysis. In this paper, we represent data from two different modalities as a graph and f...