165 search results - page 25 / 33 » Parallel Algorithm for Computing Reversal Distance |
116
click to vote
ICPP
1991
IEEE
15 years 5 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
116
click to vote
IPPS
2002
IEEE
15 years 7 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
122
click to vote
PODC
2004
ACM
15 years 7 months ago
2004
ACM
We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clo...
140
click to vote
INTENSIVE
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper an optimized k-means implementation on the graphics processing unit (GPU) is presented. NVIDIA’s Compute Unified Device Architecture (CUDA), available from the G8...
125
click to vote
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...