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->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 27  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
CPSY, DC, IPSJ-ARC
(Joint) [detail]		 2016-08-10
17:30		 Nagano Kissei-Bunka-Hall (Matsumoto) Random Grid Graph for Low-Latency Networks
Koji Nakano, Daisuke Takafuji, Satoshi Fujita (Hiroshima Univ.), Hiroki Matsutani (Keio Univ.), Ikki Fujiwara, Michihiro Koibuchi (NII) CPSY2016-38		  [more] CPSY2016-38
pp.275-280
CPSY, DC, IPSJ-ARC
(Joint) [detail]		 2015-08-06
10:45		 Oita B-Con Plaza (Beppu) An Improved Algorithm for Random Topology Generation
Daisuke Takafuji, Satoshi Fujita, Koji Nakano (Hiroshima Univ.), Ikki Fujiwara, Michihiro Koibuchi (NII) CPSY2015-37		 (To be available after the conference date) [more] CPSY2015-37
pp.217-221
CPSY 2014-11-14
09:00		 Hiroshima Hiroshima University Swapped Random Topologies for Low-latency Interconnection Networks
Michihiro Koibuchi, Fabien Chaix, Ikki Fujiwara (NII), Daisuke Takafuji, Satoshi Fujita, Koji Nakano (Hiroshima U.) CPSY2014-64		  [more] CPSY2014-64
pp.57-62
CPSY 2014-11-14
10:15		 Hiroshima Hiroshima University C2CU : A CUDA C Program Generator for Bulk Execution of a Sequential Algorithm
Daisuke Takafuji, Koji Nakano, Yasuaki Ito (Hiroshima Univ.) CPSY2014-67		 A sequential algorithm is oblivious if an address accessed at each time does not depend on input data. Many important ta... [more] CPSY2014-67
pp.75-80
DC, CPSY
(Joint)		 2013-08-02
09:00		 Fukuoka Kitakyushu-Kokusai-Kaigijyo ASCII Art Generation using the Local Exhaustive Search on the GPU
Yuji Takeuchi, Daisuke Takafuji, Yasuaki Ito, Koji Nakano (Hiroshima Univ.) CPSY2013-15		  [more] CPSY2013-15
pp.31-35
MSS, SS 2013-03-06
14:50		 Fukuoka Shikanoshima A Support Tool for Understanding Programs and Visualizing Algorithms -- Creating Flowcharts Based on Hierarchical Graph Drawings --
Rei Takahara, Fumiya Makimori, Masahiro Yamauchi (Kinki Univ.), Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) MSS2012-63 SS2012-63		 The purpose of this paper is to make a support tool for understanding programs or algorithms written by the programming ... [more] MSS2012-63 SS2012-63
pp.25-30
CAS 2013-01-28
13:50		 Oita Beppu International Convention Center On Pairwise Vertex-Disjoint Paths Linking Two Nested Rectangular Boundaries in a Rectilinear Graph
Hideto Hanada, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2012-73		 In a rectilinear graph, a rectangle is fixed in another rectangle.
The region bounded by two nested rectangles is $G$.... [more]		 CAS2012-73
pp.41-45
CAS, CS, SIP 2012-03-09
14:20		 Niigata The University of Niigata Constructing Rectangular Duals for Designing Layouts of a Multi-Layered Printed Wiring Board with Prescribed Sizes
Tomoyuki Katoh, Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2011-144 SIP2011-164 CS2011-136		  [more] CAS2011-144 SIP2011-164 CS2011-136
pp.207-212
CAS 2012-01-19
09:25		 Fukuoka Kyushu Univ. Planarity of Graphs Having Subgraphs with Fixed Embedding Constraint
Shun Ohno, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2011-86		  [more] CAS2011-86
pp.7-12
NLP, CAS 2010-08-03
09:25		 Tokushima Naruto University of Education Sharp Heuristic Algorithms for Extracting a Maximum Induced Tree from a Graph
Hiroyuki Yoshida, Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2010-48 NLP2010-64		 The problem of extracting a maximum induced tree of a graph (MAXIT), asks for a vertex set of largest cardinality among ... [more] CAS2010-48 NLP2010-64
pp.79-84
CAS, NLP 2009-09-24
10:05		 Hiroshima Hiroshima Univ. Higashi Senda Campus Vertex-Deletion-based Enhancement of Heuristic Algorithms for Extracting a Maximum Induced Tree of a Graph
Hiroyuki Yoshida, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2009-24 NLP2009-60		 The problem of extracting a maximum induced tree of a graph (MAXIT) asks for a vertex set of largest cardinality among t... [more] CAS2009-24 NLP2009-60
pp.1-6
LOIS 2009-03-06
15:40		 Okinawa Okinawa-seinen-kaikan SUMOSYS: A System for Supporting University Management Operation in Collecting/Editing/Displaying Various Information
Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) OIS2008-94		  [more] OIS2008-94
pp.113-118
CAS, CS, SIP 2009-03-03
14:40		 Gifu Nagaragawa Convention Center Computing Experiment-based Evaluation of Heuristic Algorithms for Extracting a Maximum Induced Tree of a Graph
Yuji Suga, Hiroyuki Yoshida, Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2008-139 SIP2008-202 CS2008-113		  [more] CAS2008-139 SIP2008-202 CS2008-113
pp.211-216
CAS, CS, SIP 2009-03-03
15:00		 Gifu Nagaragawa Convention Center On Solving the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs
Yuichiro Taketoshi, Satoru Ochiiwa, Satoshi Taoka (Hiroshima Univ.), Masahiro Yamauchi (Kinki Univ.), Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2008-140 SIP2008-203 CS2008-114		  [more] CAS2008-140 SIP2008-203 CS2008-114
pp.217-222
CAS, NLP 2009-01-22
14:55		 Miyazaki   Enhancing an Algorithm for Extracting a Spanning Planar Subgraph of a Terminal-Vertex Graph based on Separation Pairs and Changing Net Representations
Tomohiro Yamasaki, Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2008-76 NLP2008-106		  [more] CAS2008-76 NLP2008-106
pp.69-74
CAS, MSS 2008-11-07
13:25		 Osaka Osaka University Heuristic Algorithms for Extracting a Maximum Induced Tree of a Graph
Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2008-58 CST2008-36		 The problem of extracting a maximum induced tree of a graph (MAXIT) asks for a vertex set of largest cardinality
among ... [more]		 CAS2008-58 CST2008-36
pp.77-82
CS, SIP, CAS 2008-03-06
15:35		 Yamaguchi Yamaguchi University A parallel algorithm based on area-partitioning for the rectilinear Steiner problem
Kazuhiro Egashira, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-123 SIP2007-198 CS2007-88		  [more] CAS2007-123 SIP2007-198 CS2007-88
pp.85-90
SIP, CAS, CS 2007-03-05
15:35		 Tottori Blancart Misasa (Tottori) An Algorithm for Extracting a Spanning Planar Subgraph in a Terminal-Vertex Graph Model of a Circuit
Katsutoshi Nakanishi, Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2006-89 SIP2006-190 CS2006-106		  [more] CAS2006-89 SIP2006-190 CS2006-106
pp.69-74
CAS 2007-01-30
09:30		 Ehime Ehime Univ. Experiment-based Evaluation of Algorithm Performance for the 2- or 3-Vertex Connectivity Augmentation Problem
Hiroharu Sumiyoshi, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) 		 [more] CAS2006-70
pp.1-6
CAS, MSS 2006-11-20
15:10		 Nagasaki Nagasaki Univ. Application of a Compaction Method for Rectilinear Drawing of Graphs to Layout Design of Printed Wiring Boards
Atsushi Tsuji, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) 		 [more] CAS2006-50 CST2006-26
pp.49-54
 Results 1 - 20 of 27  /  [Next]  
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