Nanda Kambhatla
ACL 2004
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.
Nanda Kambhatla
ACL 2004
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design