335 search results - page 30 / 67 » High quality graph partitioning |
DAWAK
2007
Springer
14 years 5 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
WOWMOM
2005
ACM
14 years 4 months ago
2005
ACM
— Message ferrying (MF) [2], a viable solution for routing in highly partitioned ad-hoc networks, exploits message ferries to transfer packets between disconnected nodes. This pa...
AIPS
2010
14 years 1 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
IPPS
1999
IEEE
14 years 3 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
SIGIR
2008
ACM
13 years 10 months ago
2008
ACM
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...