15494 search results - page 206 / 3099 » Computing dynamic clusters |
166
click to vote
ICDCS
2006
IEEE
16 years 11 days ago
2006
IEEE
This paper presents an analysis of the control overhead involved in clustering and routing for one-hop clustered mobile ad hoc networks. Previous work on the analysis of control o...
140
click to vote
AAAI
2008
15 years 8 months ago
2008
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
174
click to vote
PPOPP
2006
ACM
16 years 8 days ago
2006
ACM
Recently there has been renewed interest in building reliable servers that support continuous application operation. Besides maintaining system state consistent after a failure, o...
182
click to vote
EXPCS
2007
15 years 8 months ago
2007
Pipeline Spectroscopy is a new technique that allows us to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogram, which represents a precis...
169
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...