Robert C. Durbeck
IEEE TACON
We consider the problem of mining association rules on a shared-nothing multiprocessor. We present three algorithms that explore a spectrum of trade-offs between computation, communication, memory usage, synchronization, and the use of problem-specific information. The best algorithm exhibits near perfect scaleup behavior, yet requires only minimal overhead compared to the current best serial algorithm. ©1996 IEEE.
Robert C. Durbeck
IEEE TACON
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Limin Hu
IEEE/ACM Transactions on Networking