John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
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
M. Tismenetsky
International Journal of Computer Mathematics
Conference paper
Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence