𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Min-cut partitioning on underlying tree and graph structures

✍ Scribed by Tragoudas, S.

Book ID
119772464
Publisher
IEEE
Year
1996
Tongue
English
Weight
599 KB
Volume
45
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Torus structure on graphs and twisted pa
Torus structure on graphs and twisted partition functions for minimal and affine models
✍ R. Coquereaux; M. Huerta πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 530 KB

Using the Ocneanu quantum geometry of ADE diagrams (and of other diagrams belonging to higher Coxeter-Dynkin systems), we discuss the classification of twisted partition functions for affine and minimal models in conformal field theory and study several examples associated with the WZW, Virasoro and

[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