Temporal partitioning and scheduling data flow graphs for reconfigurable computers

[IEEE Comput. Soc 2001 IEEE Internationa

[IEEE Comput. Soc 2001 IEEE International Conference on Data Mining - San Jose, CA, USA (29 Nov.-2 Dec. 2001)] Proceedings 2001 IEEE International Conference on Data Mining - A min-max cut algorithm for graph partitioning and data clustering

✍ Ding, C.H.Q.; Xiaofeng He, ; Hongyuan Zha, ; Ming Gu, ; Simon, H.D. 📂 Article 📅 2001 🏛 IEEE Comput. Soc 🌐 English ⚖ 796 KB

This proceedings of the November 2001 conference explores the design, analysis and implementation of data mining theory and systems. The 72 regular papers and 37 posters discuss data mining algorithms, data and knowledge representation, modeling of data to support data mining, scalability issues, st