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

Search Results: Keywords 'from:2017-08-18 to:2017-08-18'
[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 2017-08-18
10:30		 Aomori   A Reconstruction and Implementation of the First FSSP Algorithm
Hiroshi Umeo, Mitsuki Hirota, Youhei Nozaki, Keisuke Imai, Takashi Sogabe (OECU) COMP2017-13		  [more] COMP2017-13
pp.1-7
COMP 2017-08-18
11:05		 Aomori   Study of Evaluation Method of FPGA Accelerator for In-memory Columnar DB in Speed-up of Online Analytical Processing (OLAP)
Tetsuro Hommura, Yoshifumi Fujikawa (Hitachi) COMP2017-14		 Recently, real time analysis, which uses fresher data than ever before, is the trend. It is expected to be used in vario... [more] COMP2017-14
pp.9-16
COMP 2017-08-18
11:40		 Aomori   Study of the Method of Dictionary Encoding for Column Data in FPGA Accelerator for the In-Memory Columnar Database
Yoshifumi Fujikawa, Tetsuro Hommura (Hitachi) COMP2017-15		 Recently, real time analysis, which uses fresher data than ever before, is the trend. It is expected to be used in vari... [more] COMP2017-15
pp.17-23
COMP 2017-08-18
14:15		 Aomori   A generalization of the minimal dominating set problem and its self-stabilizing algorithm
Hisaki Kobayashi, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2017-16		  [more] COMP2017-16
pp.25-32
COMP 2017-08-18
14:50		 Aomori   A dynamic programming based algorithm for enumerating unlabeled unrooted trees
Ryuji Masui, Aleksandar Shurbevski, Hiroshi Nagamochi (Kyoto Univ.) COMP2017-17		 We propose a dynamic programming based algorithm for the enumeration of unlabeled and unrooted trees on $n$ vertices. Th... [more] COMP2017-17
pp.33-40
COMP 2017-08-18
15:55		 Aomori   Secure Domination in Proper Interval Graphs
Toru Araki, Hiroka Miyazaki (Gunma Univ.) COMP2017-18		 A subset $S$ of vertices in a graph $G$ is a secure dominating set of $G$ if $S$ is a dominating set of $G$ and, for eac... [more] COMP2017-18
pp.41-46
COMP 2017-08-18
16:30		 Aomori   K_3 edge cover problem in a wide sense
Kyohei Chiba, Remy Belmonte, Hiro Ito (UEC), Atsuki Nagao (Seikei Univ.) COMP2017-19		  [more] COMP2017-19
pp.47-55
 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