291 search results - page 28 / 59 » Clustering and the Biclique Partition Problem |
111
click to vote
ICDM
2009
IEEE
15 years 8 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
113
click to vote
USENIX
2000
15 years 2 months ago
2000
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, r...
124
click to vote
SDM
2007
SIAM
15 years 2 months ago
2007
SIAM
Many clustering algorithms have been proposed to partition a set of static data points into groups. In this paper, we consider an evolutionary clustering problem where the input d...
WCRE
1999
IEEE
15 years 5 months ago
1999
IEEE
The software clustering problem has attracted much attention recently, since it is an integral part of the process of reverse engineering large software systems. A key problem in ...
115
click to vote
NIPS
2001
15 years 2 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...