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

Search Results: Keywords 'from:2012-04-27 to:2012-04-27'
[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 2012-04-27
10:00		 Osaka Osaka Prefecture University Query Complexity for List Decoding
Akinori Kawachi (Tokyo Inst. of Tech.) COMP2012-1		  [more] COMP2012-1
pp.1-5
COMP 2012-04-27
10:35		 Osaka Osaka Prefecture University 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.) COMP2012-2		 This paper investigates the number of quantum queries made
to solve the problem of reconstructing an unknown string fro... [more]		 COMP2012-2
pp.7-14
COMP 2012-04-27
11:10		 Osaka Osaka Prefecture University Generation of Ternary Matroids and Experiments on White's Conjecture
Hidefumi Hiraishi, Hiroshi Imai (Univ. of Tokyo), Sonoko Moriyama (Tohoku Univ.) COMP2012-3		 In this paper, we deal with White's conjectures.
White's conjectures are two classical conjectures of matroid theory,
... [more]		 COMP2012-3
pp.15-21
COMP 2012-04-27
13:20		 Osaka Osaka Prefecture University Sequence Binary Decision Diagrams with Mapping Edges
Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.) COMP2012-4		 A Binary Decision Diagram (BDD) gives efficient boolean function manipulations. The memory efficiency of BDDs depends on... [more] COMP2012-4
pp.23-28
COMP 2012-04-27
13:55		 Osaka Osaka Prefecture University Improved algorithm for partially ordered scheduling problem using dynamic programming with a changed order
Keigo Oka (Univ. of Tokyo) COMP2012-5		  [more] COMP2012-5
pp.29-35
COMP 2012-04-27
14:45		 Osaka Osaka Prefecture University 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) COMP2012-6		  [more] COMP2012-6
pp.37-43
COMP 2012-04-27
15:20		 Osaka Osaka Prefecture University Algorithm for Reporting All Segment Intersections Using Work Space of Arbitrary Size
Matsuo Konagaya, Tetsuo Asano (JAIST) COMP2012-7		 This paper presents an efficient algorithm for reporting all intersections
among $n$ given line segments in the plane u... [more]		 COMP2012-7
pp.45-52
 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