| IEICE Technical Committee Submission System Advance Program |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
|
=============================================== Technical Committee on Theoretical Foundations of Computing (COMP) Chair: Tetsuo Asano (JAIST) Vice Chair: Kazuhisa Makino (Univ. of Tokyo) Secretary: Takehiro Ito (Tohoku Univ.), Akinori Kawachi (Tokyo Inst. of Tech.) DATE: Fri, Apr 27, 2012 10:00 - 15:55 PLACE: Osaka Prefecture University, Nakamozu Campus, Bldg. A12, Science Hall(1-1 Gakuen-cho, Naka-ku, Sakai 599-8531, Japan. Access ( http://www.osakafu-u.ac.jp/english/info/campusguide/access.html ) Nakamozu Campus( http://www.osakafu-u.ac.jp/english/info/campusguide/nakamozu_zoom.html ). Prof. Yushi UNO (Osaka Prefecture University)) TOPICS: ---------------------------------------- Fri, Apr 27 (10:00 - 15:55) ---------------------------------------- (1) 10:00 - 10:35 Query Complexity for List Decoding Akinori Kawachi (Tokyo Inst. of Tech.) (2) 10:35 - 11:10 Reconstructing Strings from Substrings with Quantum Queries Richard Cleve (Univ. of Waterloo), Kazuo Iwama (Kyoto Univ.), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT), Junichi Teruyama (Kyoto Univ.), Shigeru Yamashita (Ritsumeikan Univ.) (3) 11:10 - 11:45 Generation of Ternary Matroids and Experiments on White's Conjecture Hidefumi Hiraishi, Hiroshi Imai (Univ. of Tokyo), Sonoko Moriyama (Tohoku Univ.) ----- Lunch Break ( 95 min. ) ----- (4) 13:20 - 13:55 Sequence Binary Decision Diagrams with Mapping Edges Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.) (5) 13:55 - 14:30 Improved algorithm for partially ordered scheduling problem using dynamic programming with a changed order Keigo Oka (Univ. of Tokyo) ----- Break ( 15 min. ) ----- (6) 14:45 - 15:20 On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes Takashi Horiyama (Saitama Univ.), Takehiro Ito, Natsuda Kaothanthong (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST), Takeshi Tokuyama (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) (7) 15:20 - 15:55 Algorithm for Reporting All Segment Intersections Using Work Space of Arbitrary Size Matsuo Konagaya, Tetsuo Asano (JAIST) # Information for speakers General Talk will have 25 minutes for presentation and 10 minutes for discussion. === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Mon, May 14, 2012: Ehime University [Wed, Mar 14] Thu, Jun 21, 2012: Hokkaido University [Wed, Apr 11] # SECRETARY: Takehiro ITO Graduate School of Information Sciences, Tohoku University. Aramaki aza Aoba 6-6-05, Aoba-ku Sendai 980-8579, Japan Email:      ecei     Last modified: 2012-03-22 14:51:23 |
Notification: Mail addresses are partially hidden against SPAM.
[Download Paper's Information (in Japanese)] <-- Press download button after click here.
[Cover and Index of IEICE Technical Report by Issue]
[Presentation and Participation FAQ] (in Japanese)
[Return to COMP Schedule Page] /
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]