𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Content Computing Volume 3309 || A New FP-Tree Algorithm for Mining Frequent Itemsets

✍ Scribed by Chi, Chi-Hung; Lam, Kwok-Yan


Book ID
120186106
Publisher
Springer Berlin Heidelberg
Year
2004
Weight
343 KB
Category
Article
ISBN
3540304835

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


[Lecture Notes in Computer Science] Flex
✍ Bell, David A.; Hong, Jun πŸ“‚ Article πŸ“… 2006 πŸ› Springer Berlin Heidelberg 🌐 English βš– 388 KB

This book constitutes the refereed proceedings of the 23rd British National Conference on Databases, BNCOD 23, held in Belfast, Northern Ireland, July 2006. The volume presents 12 revised full papers and 6 revised short papers, together with 2 invited lectures and 13 poster papers. Topical sections

[Lecture Notes in Computer Science] Netw
✍ Hsu, Ching-Hsien; Li, Xiaoming; Shi, Xuanhua; Zheng, Ran πŸ“‚ Article πŸ“… 2013 πŸ› Springer Berlin Heidelberg 🌐 English βš– 741 KB

This book constitutes the proceedings of the 10th IFIP International Conference on Network and Parallel Computing, NPC 2013, held in Guiyang, China, in September 2013. The 34 papers presented in this volume were carefully reviewed and selected from 109 submissions. They are organized in topical sect

[Lecture Notes in Computer Science] Para
✍ Malyshkin, Victor πŸ“‚ Article πŸ“… 2007 πŸ› Springer Berlin Heidelberg 🌐 English βš– 450 KB

This book constitutes the refereed proceedings of the 9th International Conference on Parallel Computing Technologies, PaCT 2007, held in conjunction with the Russian-Taiwan symposium on Methods and Tools of Parallel Programming of Multicomputers. It covers models and languages, applications, techni