10 papers:
SAC-2011-GalvaoD #distance #permutation #symmetry- Computing rearrangement distance of every permutation in the symmetric group (GRG, ZD), pp. 106–107.
ICDAR-2009-SharmaKS #online #recognition #word- Rearrangement of Recognized Strokes in Online Handwritten Gurmukhi Words Recognition (AS, RK, RKS), pp. 1241–1245.
- SAC-2007-ChiangH #adaptation #file system #performance
- Improving the performance of log-structured file systems with adaptive block rearrangement (MLC, JSH), pp. 1136–1140.
ASE-2006-Maurer #assembly- The Rearranger — A New Assembler Utility (WDM), pp. 357–358.
- SAC-2005-LeeWC #clustering #performance
- Rearranging data objects for efficient and stable clustering (GL, XW, JC), pp. 519–523.
ICML-2004-ClimerZ #approach #clustering- Take a walk and cluster genes: a TSP-based approach to optimal rearrangement clustering (SC, WZ).
- SAC-2002-FujimotoNHN #latency #order
- Response order rearrangement on a caching proxy for reducing WWW latency (HF, TN, KH, SN), pp. 845–851.
DATE-2001-ShinKC #optimisation- An operation rearrangement technique for power optimization in VLIM instruction fetch (DS, JK, NC), p. 809.
ASPLOS-1991-KatevenisT #branch #memory management- Reducing the Branch Penalty by Rearranging Instructions in Double-Width Memory (MK, NT), pp. 15–27.
PODS-1986-OlkenR #performance- Rearranging Data to Maximize the Efficiency of Compression (FO, DR), pp. 78–90.
