879 search results - page 47 / 176 » Performance Evaluation of Routing Algorithms in RHiNET-2 Clu... |
120
click to vote
ASUNAM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
154
click to vote
CCGRID
2007
IEEE
15 years 7 months ago
2007
IEEE
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
105
click to vote
SIGIR
2002
ACM
15 years 1 months ago
2002
ACM
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
DAGSTUHL
2007
15 years 2 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
140
click to vote
SIGMETRICS
2011
ACM
14 years 4 months ago
2011
ACM
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...