334 search results - page 3 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
109
click to vote
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
ALGORITHMICA
2010
14 years 9 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
117
click to vote
IPCV
2008
14 years 11 months ago
2008
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
103
click to vote
INFOVIS
2003
IEEE
15 years 2 months ago
2003
IEEE
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...