22 search results - page 5 / 5 » Randomized minimum spanning tree algorithms using exponentia... |
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...