English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6481/11653
Visitors : 23357495      Online Users : 207
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/11903

Title: Parallel TID-Based Maximal Frequent Itemsets Mining Algorithms with Dynamic Task Scheduling for Heterogeneous Cluster Systems
Authors: Wu, Chao-Chin;Lai, Lien-Fu;Huang, L. T.;Jhan, S. S.;Lu, C.
Contributors: 資訊工程學系
Date: 2011-01
Issue Date: 2012-07-02T02:27:28Z
Publisher: 國立台灣大學
Relation: The First Symposium on Cloud and Service Computing (SC2-2011), 國立台灣大學, Jan. 20-21, 2011
Appears in Collections:[資訊工程學系] 會議論文

Files in This Item:

There are no files associated with this item.



All items in NCUEIR are protected by copyright, with all rights reserved.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback