Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
During the last few years, the concepts of cluster computing and heterogeneous networked systems have received increasing interest. The popularity of using Java for developing par...
Jameela Al-Jaroodi, Nader Mohamed, Hong Jiang, Dav...
Several models of parallel disks are found in the literature. These models have been proposed to alleviate the I/O bottleneck arising in handling voluminous data. These models hav...
We present new parallel algorithms for 3D reconstruction of objects from 2D projections and their application for the determination of the structure of macromolecules from electro...
Robert E. Lynch, Dan C. Marinescu, Hong Lin, Timot...