| 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 | 2021-05-08 13:30 |
Online | Online | [Invited Talk]
Overview and Prospective Reserch Activities of Grant-in-Aid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project Shin-ichi Minato (Kyoto Univ.)  COMP2021-8 |
Algorithms, the techniques of logical procedures of information processing, perform a key part of the recent sophisticat... [more] | COMP2021-8 p.54 |
| COMP | 2020-12-04 10:00 |
Online | Online | A Fast ZDD-Based Method for Enumerating All Solutions of Cost-Bounded Combinatorial Problems Shin-ichi Minato (Kyoto Univ.), Mutsunori Banbara (Nagoya Univ.), Takashi Horiyama (Hokkaido Univ.), Jun Kawahara (Kyoto Univ.), Ichigaku Takigawa (Hokkaido Univ.), Yutaro Yamaguchi (Kyushu Univ.) COMP2020-19 |
[more] | COMP2020-19 pp.8-15 |
| VLD, DC, RECONF, ICD, IPSJ-SLDM (Joint) [detail] |
2020-11-17 14:25 |
Online | Online | Variable Ordering for Minimizing Power Consumption of BDD-based Optical Logic Circuits Ryosuke Matsuo, Shin-ichi Minato (Kyoto Univ) VLD2020-24 ICD2020-44 DC2020-44 RECONF2020-43 |
Optical logic circuits based on integrated nanophotonics have attracted significant interest due to their ultra-high-spe... [more] | VLD2020-24 ICD2020-44 DC2020-44 RECONF2020-43 pp.78-83 |
| COMP | 2019-09-02 10:50 |
Okayama | Tsushima Campus, Okayama University | Shortest Universal Sequences of Adjacent Transpositions Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shin-ichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-10 |
Let $S = {s_1,s_2, ... , s_m}$ be a sequence of adjacent transpositions of $[n]={1,2,ldots ,n}$. We denote by $Comp(S) =... [more] | COMP2019-10 pp.1-5 |
| COMP, IPSJ-AL | 2019-05-11 10:40 |
Kumamoto | Kumamoto University | 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 |
| COMP | 2018-10-26 15:45 |
Kyoto | Kyoto University | Recent Activities of Discrete Structure Manipulation System Project Shin-ichi Minato (Kyoto Univ.) COMP2018-28 |
After five years execution of ERATO Minato Discrete Structure Manipulation System Project from 2010 to 2015, as the succ... [more] | COMP2018-28 p.55 |
| IN | 2017-07-19 09:40 |
Hokkaido | Japan Red Cross Hokkaido College of Nursing | Network Reduction Method that Minimizes Total Capacity Change for Virtual Network Embedding Acceleration Toru Mano, Takeru Inoue, Kimihiro Mizutani (NTT), Shin-ichi Minato (Hokkaido Univ.), Osamu Akashi (NTT) IN2017-21 |
Virtual network (NW) embedding technology is essential for NW virtualization. Although the linear programming relaxation... [more] | IN2017-21 pp.13-18 |
| NC, IPSJ-BIO, IBISML, IPSJ-MPS [detail] | 2017-06-24 09:30 |
Okinawa | Okinawa Institute of Science and Technology | Efficient Adversarial Combinatorial Bandit Algorithm via Zero-suppressed Decision Diagrams Shinsaku Sakaue (NTT), Masakazu Ishihata, Shin-ichi Minato (Hokkaido Univ.) IBISML2017-1 |
We propose an algorithm for the adversarial combinatorial bandit problem, which is a sequential decision problem. The pr... [more] | IBISML2017-1 pp.43-48 |
| COMP | 2015-12-01 10:30 |
Osaka | A Fast Method for Solving Constrained Shortest Path Problems on Directed Acyclic Graphs Fumito Takeuchi (Hokkaido Univ.), Masaaki Nishino (NTT), Norihito Yasuda (Hokkaido Univ.), Takuya Akiba (NII), Shin-ichi Minato (Hokkaido Univ.), Masaaki Nagata (NTT) COMP2015-31 |
This paper deals with shortest path problems on directed acyclic graphs (DAGs), under logical constraints posed between... [more] | COMP2015-31 pp.9-16 |
|
| COMP | 2015-09-01 14:30 |
Nagano | Enumerating and Indexing Walks Between Any Pair of Vertices Hiroshi Aoki, Norihito Yasuda, Shin-ichi Minato (Hokkaido Univ.) COMP2015-21 |
This paper presents a method for enumerating and indexing all the walks between any two points in a given graph. It is ... [more] |
COMP2015-21 pp.35-39 |
|
| COMP | 2015-04-23 14:10 |
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 | 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 |
| COMP | 2014-10-08 15:15 |
Tokyo | Chuo University | Fast Indexing All Eulerian Trails Using Permutation Decision Diagrams Yuma Inoue, Shin-ichi Minato (Hokkaido Univ.) COMP2014-30 |
An Eulerian trail is a trail containing all edges of a given graph exactly once. Although counting problem of Eulerian ... [more] |
COMP2014-30 pp.25-29 |
| CS, NS, IN (Joint) |
2014-09-11 10:00 |
Miyagi | Tohoku Univ. Research Institute of Electrical Communication 2gokan | Packet Classification for Global Network View of SDN with MDDs Takeru Inoue, Toru Mano, Kimihiro Mizutani (NTT), Shin-ichi Minato (Hokkaido Univ.), Osamu Akashi (NTT) IN2014-50 |
In software-defined networking, applications are allowed to access a global view of the network so as to provide sophis... [more] |
IN2014-50 pp.1-6 |
| COMP | 2013-10-18 10:40 |
Aichi | Nagoya Institute of Technology | Three-way Indexing ZDDs for Large Scale Sparse Dataset Hiroshi Aoki (Hokkaido Univ.), Takahisa Toda (JST), Shin-ichi Minato (Hokkaido Univ.) COMP2013-32 |
[more] | COMP2013-32 pp.1-8 |
| COMP | 2013-03-18 13:20 |
Gifu | Gifu University | 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 | 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 | 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 | [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 |
| IN, NV (Joint) |
2012-07-19 16:25 |
Hokkaido | Hokkaido Univ. | [Invited Talk]
Frontier-based Method: Efficient Graph Enumeration and Indexing Using BDDs/ZDDs Shin-ichi Minato (Hokkaido Univ./JST) IN2012-38 |
Discrete structure manipulation is a fundamental technique for many problems solved by computers. Recently, BDD/ZDD attr... [more] | IN2012-38 pp.31-36 |
[Return to Top Page]