D.S. Turaga, K. Ratakonda, et al.
SCC 2006
Paper
Noisy sort, a memory-intensive sorting algorithm
Abstract
A table-lookup technique for sorting is developed. It is a highly parallel method which develops an approximation to the sort through a single access to an associative memory. A postprocessing step is intended to complete the sort. The scheme is most effective for special data classes. © 1989.
Related
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence