IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

Technical Committee on Theoretical Foundations of Computing (COMP)  (Searched in: 2009)

Search Results: Keywords 'from:2009-10-16 to:2009-10-16'
[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 7 of 7  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2009-10-16
10:00		 Miyagi Tohoku University On simultaneous optimal segmentation of digital objects
Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama (Tohoku Univ.) COMP2009-32		 Motivated from the image segmentation problem, we consider the problem of finding the maximum weight region with a shape... [more] COMP2009-32
pp.1-8
COMP 2009-10-16
10:35		 Miyagi Tohoku University Small Grid Drawings of Planar Graphs with Balanced Bipartition
Xiao Zhou, Takashi Hikino, Takao Nishizeki (Tohoku Univ.) COMP2009-33		 In a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line... [more] COMP2009-33
pp.9-15
COMP 2009-10-16
11:10		 Miyagi Tohoku University Reformulation of the scheme for computing tree-width and minimum fill-in
Masanobu Furuse, Yota Otachi, Koichi Yamazaki (Gunma Univ.) COMP2009-34		 Bouchitt´e and Todinca introduced a scheme, i.e., Dynamic Programming based on recursive formulas in terms of minimal se... [more] COMP2009-34
pp.17-24
COMP 2009-10-16
13:30		 Miyagi Tohoku University [Invited Talk] Algorithms for Conflict Resolution
Dao-Zhi Zeng (Tohoku Univ.) COMP2009-35		  [more] COMP2009-35
p.25
COMP 2009-10-16
14:50		 Miyagi Tohoku University Algorithm for Finding Minimum Reaction Cut of Metabolic Network
Takeyuki Tamura (Kyoto Univ.), Kazuhiro Takemoto (Univ. of Tokyo.), Tatsuya Akutsu (Kyoto Univ.) COMP2009-36		 In this article, we study two problems ReactionCut and MD-ReactionCut
for calculating minimum reaction cuts of a metabo... [more]		 COMP2009-36
pp.27-34
COMP 2009-10-16
15:25		 Miyagi Tohoku University An Improved Approximation Lower Bound for Maximum Cardinality Almost Stable Matching Problem
Koki Hamada, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) COMP2009-37		 In the stable marriage problem that allows incomplete preference
lists, all stable matchings for a given instance have ... [more]		 COMP2009-37
pp.35-40
COMP 2009-10-16
16:00		 Miyagi Tohoku University Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Kenya Ueno (Univ. of Tokyo) COMP2009-38		 Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectang... [more] COMP2009-38
pp.41-48
 Results 1 - 7 of 7  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan