1285 search results - page 106 / 257 » On the Complexity of Ordinal Clustering |
TCS
2010
13 years 8 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
PODS
2008
ACM
14 years 10 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
CLUSTER
2008
IEEE
14 years 4 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
CLUSTER
2007
IEEE
14 years 4 months ago
2007
IEEE
— The service-oriented architecture has come a long way in solving the problem of reusability of existing software resources. Grid applications today are composed of a large numb...
CLUSTER
2006
IEEE
14 years 4 months ago
2006
IEEE
Heterogeneous networks of computers have rapidly become a very promising commodity computing solution, expected to play a major role in the design of high performance computing sy...