10 search results - page 1 / 2 » An improved algorithm for sorting by block-interchanges base... |
IPL
2010
13 years 2 months ago
2010
SPAA
1996
ACM
13 years 11 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
IPL
2008
13 years 7 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
IPL
2006
13 years 7 months ago
2006
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
BMCBI
2008
13 years 7 months ago
2008
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...