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: 2011)

Search Results: Keywords 'from:2011-09-06 to:2011-09-06'
[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP, IPSJ-AL 2011-09-06
10:25		 Hokkaido Hakodate City Central Library A PTAS for the Subset Sum Reconfiguration Problem
Takehiro Ito (Tohoku Univ.), Erik D. Demaine (MIT) COMP2011-22		  [more] COMP2011-22
pp.7-14
COMP, IPSJ-AL 2011-09-06
11:15		 Hokkaido Hakodate City Central Library On A DAG Constructing Self-stabilizing Protocol for GeoCast in MANET
Koichi Ito, Yoshiaki Katayama, Koichi Wada, Naohisa Takahashi (Nitech) COMP2011-23		 Geocasting is a mechanism to deliver messages of interest to all hosts within a given geographical region. GeoTORA is on... [more] COMP2011-23
pp.23-30
COMP, IPSJ-AL 2011-09-06
13:45		 Hokkaido Hakodate City Central Library Experimental Evaluation of Algorithm for Minimum-Weight Rooted Not-Necessarily-Spanning Arborescence Problem
Yusuke Abe, Eishi Chiba (Hosei Univ.) COMP2011-24		 We study a problem that finds a minimum-weight rooted not-necessarily-spanning arborescence
in a connected acyclic dig... [more]		 COMP2011-24
pp.39-45
COMP, IPSJ-AL 2011-09-06
14:50		 Hokkaido Hakodate City Central Library Extended Pseudo-tree Pattern Matching with labels of strings
Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano NCT) COMP2011-25		 Given two unordered labeled trees P and T , the tree pattern matching problem for unordered labeled trees is to find all... [more] COMP2011-25
pp.53-60
COMP, IPSJ-AL 2011-09-06
15:40		 Hokkaido Hakodate City Central Library Lower Bounds for Linear Decision Trees via An Energy Complexity Argument
Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.) COMP2011-26		 A linear decision tree is a binary decision tree in which
a classification rule at each internal node is defined by
a ... [more]		 COMP2011-26
pp.67-73
COMP, IPSJ-AL 2011-09-06
16:45		 Hokkaido Hakodate City Central Library Unfoldings of Platonic Solids with Minimum/Maximum Diameter, Width, and Enclosing-Rectangle
Takashi Horiyama, Wataru Shoji (Saitama Univ.) COMP2011-27		 A tetrahedron has 2 edge unfoldings. A cube and an octahedron
have 11 unfoldings, respectively. A dodecahedron and
an ... [more]		 COMP2011-27
pp.83-89
 Results 1 - 6 of 6  /   
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