| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2024-09-05 15:30 |
Hiroshima | Hiroshima Institute of Technology (Hiroshima, Online) (Primary: On-site, Secondary: Online) |
Computing Betweenness Centrality in Time-varying Network using Zero-suppressed Binary Decision Diagram Daiki Ando, Yu Nakahata, Shoji Kasahara (NAIST)  COMP2024-10 |
Betweenness Centrality (BC) is a measure of the importance of the vertices in a network. BC has been extensively studied... [more] | COMP2024-10 pp.1-7 |
| COMP | 2023-03-02 11:00 |
Tokyo | Ochanomizu University (Tokyo) | Finding Forcing on ZDD by Dynamic Programming Takashi Harada, Shogo Takeuchi (Kochi Univ. of Tech.) COMP2022-33 |
Exact cover problem takes a set S and a subset F of the power set of S as an input and determines whether there exists a... [more] | COMP2022-33 pp.1-6 |
| IT, ISEC, RCC, WBS | 2022-03-11 16:25 |
Online | Online (Online) | An Efficient Method for Constructing Garbled Circuits Using Linked Lists Guangjian Liu, Hikaru Morita (Graduate School of Kanagawa Univ) IT2021-131 ISEC2021-96 WBS2021-99 RCC2021-106 |
Since the proposal of the Garbled Circuit by Yao, a number of construction methods for secret circuits have been propose... [more] | IT2021-131 ISEC2021-96 WBS2021-99 RCC2021-106 pp.281-284 |
| ISEC, IT, WBS | 2020-03-11 12:10 |
Hyogo | University of Hyogo (Hyogo) (Cancelled but technical report was issued) |
A Construction Method of Garbled Circuits for ZDD Takayuki Masui, Hikaru Morita (Graduate Schoool, Kanagawa Univ) IT2019-114 ISEC2019-110 WBS2019-63 |
Kruger et al proposed a new method to construct Garbled Circuits for BDD, which gives a compression expression of logic... [more] | IT2019-114 ISEC2019-110 WBS2019-63 pp.167-170 |
| SITE | 2019-12-06 13:50 |
Kanagawa | (Kanagawa) | Deciding Equivalence of The Rule List Policies via SAT solver Takashi Fuchino (Kanagawa Univ.), Takashi Harada (Kochi Univ. of Tech), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) SITE2019-82 |
Packet classification is to determine the behaviors of packets incoming to network devices. Since it is achieved using l... [more] | SITE2019-82 pp.13-19 |
| COMP, IPSJ-AL | 2019-05-11 10:40 |
Kumamoto | Kumamoto University (Kumamoto) | Enumerating and Indexing Graph Subdivisions using Zero-suppressed Binary Decision Diagrams Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shin-ichi Minato (Kyoto Univ.) COMP2019-3 |
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$. In this paper, when ... [more] |
COMP2019-3 pp.51-58 |
| VLD, DC, CPSY, RECONF, CPM, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC (Joint) [detail] |
2017-11-06 13:25 |
Kumamoto | Kumamoto-Kenminkouryukan Parea (Kumamoto) | RECONF2017-38 |
Graph processing has memory access with low locality, and it is not easy to process large-scale graphs which have the mi... [more] | RECONF2017-38 pp.7-12 |
| SIP, CAS, MSS, VLD | 2017-06-19 14:10 |
Niigata | Niigata University, Ikarashi Campus (Niigata) | Computing the Number of Packets that match A Filtering Rule via MTZDDs Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) CAS2017-9 VLD2017-12 SIP2017-33 MSS2017-9 |
A filtering policy is denoted as a filtering rule list and is achieved by linear search of the rule list. The increase i... [more] | CAS2017-9 VLD2017-12 SIP2017-33 MSS2017-9 pp.45-50 |
| DC, SS | 2016-10-27 11:00 |
Shiga | Hikone Kinro-Fukushi Kaikan Bldg. (Shiga) | ZDD-based test case generation method for high strength combinatorial interaction testing Teru Ohashi, Tatsuhiro Tsuchiya (Osaka Univ) SS2016-18 DC2016-20 |
Combinatorial interaction testing is a well practiced software testing method. This method requires any $t$-wise para... [more] |
SS2016-18 DC2016-20 pp.1-6 |
| COMP, IPSJ-AL | 2016-06-24 15:45 |
Ishikawa | (Ishikawa) | Enumerating Letter Graphs by Zero-suppressed Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kobe Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2016-8 |
A zero-suppressed binary decision diagram (ZDD) is a compact data structure that represents a family of sets. A framewor... [more] | COMP2016-8 pp.33-40 |
| IN, NV (Joint) |
2015-07-17 11:15 |
Hokkaido | Hokkaido University (Hokkaido) | [Invited Talk]
Exploiting ZDDs on Constrained Dynamic Programming Problems Norihito Yasuda (Hokkaido Univ.) IN2015-34 |
Dynamic Programming is a fundamental tool for many optimization problems. However, in practical situations, in addition ... [more] | IN2015-34 pp.67-72 |
| COMP | 2015-04-23 14:10 |
Miyagi | (Miyagi) | Frontier Method for Enumerating and Indexing the Vertex Induced Subgraphs Hirofumi Suzuki, Shin-ichi Minato (Hokkaido Univ.) COMP2015-3 |
(To be available after the conference date) [more] | COMP2015-3 pp.15-20 |
| COMP | 2015-03-09 11:10 |
Kyoto | Ritsumeikan University (Kyoto) | ZDD Construction for Maximal Independent Set Enumeration on Hypergraph Teruji Sugaya (OUJ), Takahisa Toda (UEC), Shin-ichi Minato (HU) COMP2014-45 |
In this paper, we present an efficient algorithm to enumerate maximal independent sets in hypergraph. In the presented... [more] |
COMP2014-45 pp.19-27 |
| IBISML | 2014-11-18 15:00 |
Aichi | Nagoya Univ. (Aichi) | [Poster Presentation]
Enumerating all the optimal solutions of multiple travelling salesman problem by using simpath algorithm Masashi Ogawa, Masato Inoue (Waseda Univ.) IBISML2014-78 |
In this manuscript, we propose an exact method which answers all the optimal solutions of "multiple traveling salesman p... [more] | IBISML2014-78 pp.321-328 |
| IN, NV (Joint) |
2013-07-18 14:55 |
Hokkaido | Hokkaido Univ. Faculty of Eng. Academic Lounge 3 (Hokkaido) | [Invited Talk]
Graphillion: Software Library for Very Large Sets of Graphs Takeru Inoue (JST ERATO) IN2013-43 |
Several graph libraries have been developed in the past few decades, but they were designed to work with a few graphs e... [more] |
IN2013-43 pp.43-47 |
| COMP, IPSJ-AL | 2013-05-17 15:05 |
Hokkaido | Otaru University of Commerce (Hokkaido) | Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming Kazuki Morito (SEIBU CONSTRUCTION), Toshiki Saitoh, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) COMP2013-12 |
We consider an enumeration of directed binary perfect phylogenies from incomplete data. Recently, Kiyomi et al. proposed... [more] | COMP2013-12 pp.63-70 |
| COMP | 2013-03-18 13:20 |
Gifu | Gifu University (Gifu) | Auxiliary Skip Links for Quick Traversal of ZDDs to Manipulate Large-Scale Sparse Matrices Shin-ichi Minato (Hokkaido Univ.) COMP2012-55 |
ZDD (Zero-suppressed Binary Decision Diagram) is known as an efficient data structure for representing and manipulating ... [more] | COMP2012-55 pp.15-22 |
| COMP | 2013-03-18 13:45 |
Gifu | Gifu University (Gifu) | Compact and Fast Indices Based on Zero-Suppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shin-ichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) COMP2012-56 |
In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set famil... [more] | COMP2012-56 pp.23-30 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-26 10:55 |
Fukuoka | Centennial Hall Kyushu University School of Medicine (Fukuoka) | An Efficient ZDD Construction Method Using Recursive Specifications Hiroaki Iwashita, Jun Kawahara (JST), Shin-ichi Minato (Hokkaido Univ.) VLD2012-63 DC2012-29 |
In recent years, new enumeration methods using zero-suppressed binary decision diagrams (ZDDs) has been attracting atten... [more] | VLD2012-63 DC2012-29 pp.25-29 |
| CS | 2012-11-21 11:30 |
Hokkaido | Kitayuzawa Meisuitei, Hokkaido (Hokkaido) | [Special Invited Talk]
ERATO MINATO Discrete Structure Manipulation System Project and Future Prospects Shin-ichi Minato (Hokkaido Univ.) CS2012-70 |
Discrete structure manipulation is a fundamental technique for many problems solved by computers. Recently, BDD (Binary ... [more] | CS2012-70 pp.35-40 |
[Return to Top Page]