[ACM Press the Second Symposium - Hanoi, Vietnam (2011.10.13-2011.10.14)] Proceedings of the Second Symposium on Information and Communication Technology - SoICT '11 - Automatic code generation from event-B models

[ACM Press the Second Symposium - Hanoi,

[ACM Press the Second Symposium - Hanoi, Vietnam (2011.10.13-2011.10.14)] Proceedings of the Second Symposium on Information and Communication Technology - SoICT '11 - Semi-supervised learning for relation extraction in Vietnamese text

✍ Sam, Rathany Chan; Le, Huong Thanh; Nguyen, Thuy Thanh; Le, Dung Anh; Nguyen, Ng 📂 Article 📅 2011 🏛 ACM Press ⚖ 141 KB

[ACM Press the Second Symposium - Hanoi,

[ACM Press the Second Symposium - Hanoi, Vietnam (2011.10.13-2011.10.14)] Proceedings of the Second Symposium on Information and Communication Technology - SoICT '11 - Using main content extraction to improve performance of Vietnamese web page classification

✍ Trung, Nguyen Minh; Tam, Nguyen Duc; Phuong, Nguyen Hong 📂 Article 📅 2011 🏛 ACM Press ⚖ 702 KB

[ACM Press the Second Symposium - Hanoi,

[ACM Press the Second Symposium - Hanoi, Vietnam (2011.10.13-2011.10.14)] Proceedings of the Second Symposium on Information and Communication Technology - SoICT '11 - A routing algorithm of pairwise disjoint paths in a burnt pancake graph

✍ Iwasaki, Tatsuya; Kaneko, Keiichi 📂 Article 📅 2011 🏛 ACM Press ⚖ 587 KB

[ACM Press the Second Symposium - Hanoi,

[ACM Press the Second Symposium - Hanoi, Vietnam (2011.10.13-2011.10.14)] Proceedings of the Second Symposium on Information and Communication Technology - SoICT '11 - A routing algorithm of pairwise disjoint paths in a burnt pancake graph

✍ Iwasaki, Tatsuya; Kaneko, Keiichi 📂 Article 📅 2011 🏛 ACM Press ⚖ 587 KB

In this paper, we propose an algorithm that solves the kpariwise disjoint path problem in an n-burnt pancake graph where n ≥ 4 and k = n/2 in polynomial-order time of n. We also give a proof of its correctness as well as the estimates of time complexity O(n 3 ) and the maximum path length 2n + 9.