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 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2022-10-26
14:30		 Fukuoka Kyusyu Univ. Nishijin Plaza Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints
Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.) COMP2022-17		 In this paper, we address an efficient enumeration of spanning subgraphs in planar graphs with edge-connected constraint... [more] COMP2022-17
pp.21-28
COMP 2020-10-23
17:05		 Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)		 Polynomial Delay Enumeration for Steiner Problems
Yasuaki Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Kunihiro Wasa (Toyohashi Tech) COMP2020-17		 Let $G = (V, E)$ be a undirected graph and let $W subseteq V$ be a set of terminals. A emph{Steiner subgraph} of $(G, W)... [more] COMP2020-17
pp.39-46
COMP 2018-09-18
15:20		 Fukuoka Kyusyu Institute of Technology Enumeration and Random Sampling of Nonisomorphic Two-Terminal Series-Parallel Graphs
Shuhei Denzumi (UTokyo), Takashi Horiyama (Saitama Univ.), Kazuhiro Kurita (Hokudai), Yu Nakahata (NAIST), Hirofumi Suzuki (Hokudai), Kunihiro Wasa (NII), Kazuaki Yamazaki (JAIST) COMP2018-17		 A graph $G$ is a two-terminal series-parallel graph if (1) $G$ consists of two vertices and an edge between them or (2) ... [more] COMP2018-17
pp.55-62
ISEC, COMP 2017-12-22
14:40		 Kochi Eikokuji Campus, Kochi University of Technology Efficient Enumeration of Dominating Sets in K-Degenerate graphs
Kazuhiro Kurita (HU), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (HU) ISEC2017-89 COMP2017-43		 A dominating set is one of the fundamental graph structure, like clique, independent set, s-t path, and cut. It is known... [more] ISEC2017-89 COMP2017-43
pp.111-117
RCS, SIP 2010-01-21
13:10		 Fukuoka Kyushu Univ. A Design of IIR Digital Filters with Variable Stopband Using Semidefinite Programming
Nanako Ubayama, Toma Miyata, Naoyuki Aikawa (Tokyo Univ. of Science) SIP2009-80 RCS2009-214		 Several application in digital signal processing demand variable digital filters with arbitrary variable frequency respo... [more] SIP2009-80 RCS2009-214
pp.43-48
WBS, SIP 2007-08-07
08:40		 Kochi Green Hall (2nd fl.), Kochi Green-Kaikan Arbitrary-Order Non-causal Lagrange-Type Variable Fractional-Delay Digital Filters
Tian-Bo Deng (Toho Univ.) SIP2007-72 WBS2007-21		 Liu and Wei have shown that even-order polynomial interpolation can be simplified as a variable fractional-delay (VFD) f... [more] SIP2007-72 WBS2007-21
pp.1-5
 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