616 search results - page 36 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
AAIM
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
FLAIRS
2001
13 years 9 months ago
2001
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
PDCAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
JDCTA
2010
13 years 2 months ago
2010
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
GCC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Multicast is an effective means for conducting the cooperative P2P communications. This paper studies an algorithm to construct a scalable and efficient end host multica...