Sciweavers

4009 search results - page 363 / 802
» Clustering on Complex Graphs
Sort
View
HIS
2009
15 years 4 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
PODS
2008
ACM
153views Database» more  PODS 2008»
16 years 7 months ago
Approximation algorithms for co-clustering
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...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
CLUSTER
2008
IEEE
16 years 1 months ago
Divisible load scheduling with improved asymptotic optimality
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Reiji Suda
CLUSTER
2007
IEEE
16 years 1 months ago
Scalable, fault-tolerant management of Grid Services
— 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...
Harshawardhan Gadgil, Geoffrey Fox, Shrideep Palli...
CLUSTER
2006
IEEE
16 years 26 days ago
Heterogeneous Parallel Computing in Remote Sensing Applications: Current Trends and Future Perspectives
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...
Antonio J. Plaza