| 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 | 2019-09-02 15:25 |
Okayama | Tsushima Campus, Okayama University | On the number of complete k-ary trees of height h Yosuke Kikuchi (NIT, Tsuyama College), Yume Ikeda (NTTEast-Minamikanto)  COMP2019-15 |
We give the number of complete $k$-ary trees of height $h$. It is known that the number of complete binary trees of hei... [more] |
COMP2019-15 pp.27-32 |
| COMP | 2019-09-02 16:00 |
Okayama | Tsushima Campus, Okayama University | Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-16 |
This research proposes algorithms that construct compressed data structures, called zero-suppressed binary decision dia... [more] |
COMP2019-16 p.33 |
| 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 | 2019-03-18 09:30 |
Tokyo | The University of Tokyo | Range Mode Query and Solution Enumeration Kentaro Sumigawa, Kunihiko Sadakane (Univ. of Tokyo) COMP2018-43 |
The range mode query problem is constructing a data structure from the given array of $n$ terms which can efficiently an... [more] | COMP2018-43 pp.1-8 |
| COMP | 2019-03-18 09:55 |
Tokyo | The University of Tokyo | * Sumiko Harasawa, Ryuhei Uehara (JAIST) COMP2018-44 |
(To be available after the conference date) [more] | COMP2018-44 pp.9-16 |
| COMP | 2018-10-26 15:55 |
Kyoto | Kyoto University | [Invited Lecture]
Report of Presentation in SEA2018 and Recent Study Yu Nakahata, Jun Kawahara (NAIST) COMP2018-29 |
Partitioning a graph into balanced components is important for several applications. For multi-objective problems, it is... [more] | COMP2018-29 p.57 |
| 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 | 2018-09-07 12:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | [Invited Talk]
Lower Bounds on Lattice Enumeration with Extreme Pruning (from Crypto 2018) Yoshinori Aono (NICT), Phong Q. Nguyen (Inria/CNRS/JFLI/Tokyo Univ.), Takenobu Seito (BoJ), Junji Shikata (YNU) ISEC2018-56 |
We give an introduction to the paper “Lower Bounds on Lattice Enumeration with Extreme Pruning” in Crypto 2018. We prove... [more] | ISEC2018-56 p.29 |
| NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] | 2018-06-13 16:15 |
Okinawa | Okinawa Institute of Science and Technology | Enumeration of Distinct Support Vectors for Model Selection Kentaro Kanamori (Hokaido Univ.), Satoshi Hara (Osaka Univ.), Masakazu Ishihata (NTT), Hiroki Arimura (Hokaido Univ.) IBISML2018-12 |
In ordinary machine learning problems, the learning algorithm outputs a single model that optimizes its learning objecti... [more] | IBISML2018-12 pp.81-88 |
| 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 |
| IBISML | 2017-11-09 13:00 |
Tokyo | Univ. of Tokyo | Fast Computation of Lower Bounds for Privacy Evaluations, Based on Binary Decision Diagrams Shogo Takeuchi (Univ. of Tokyo), Kosuke Kusano, Jun Sakuma (Univ. of Tsukuba), Koji Tsuda (Univ. of Tokyo) IBISML2017-60 |
An input value estimation is a privacy issue in a service provides information by personal information. It is necessary ... [more] | IBISML2017-60 pp.193-200 |
| 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 |
|
| IT | 2017-07-13 16:20 |
Chiba | Chiba University | [Invited Talk]
Compression by Substring Enumeration and its Related Methods Hidetoshi Yokoo (Gunma Univ.) IT2017-26 |
This paper surveys the universal data compression method known as Compression by Substring Enumeration (CSE), developed ... [more] | IT2017-26 pp.55-60 |
| IT | 2017-07-14 14:45 |
Chiba | Chiba University | Improved Lossless Data Compression via Substring Enumeration with a Finite Alphabet Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (UEC) IT2017-34 |
Compression by substring enumeration (CSE) is a lossless universal coding algorithm.Experimental results show that the c... [more] | IT2017-34 pp.103-108 |
| COMP, IPSJ-AL | 2016-06-24 15:45 |
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 |
|
| COMP, IPSJ-AL | 2016-06-24 16:10 |
Ishikawa | Improving the lower bounds of the number of tilings for Ls in L and Sphinxes in Sphinx
-- Enumerating tilings by frontier-based search -- Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.) COMP2016-9 |
We treat with puzzles which are filled by copies of a polygon in the polygon enlarged in a certain scale. We call ... [more] | COMP2016-9 pp.41-47 |
|
| SIS | 2016-06-09 15:00 |
Hokkaido | Kushiro Tourism and Convention cent. | Enumeration of coherent signals and independent signals based on MDL principle Masakiyo Suzuki, Yasunari Maeda (KIT) SIS2016-7 |
This paper shows an exact formulation of the MDL (Minimum Description Length) criterion for simultaneously enumerating t... [more] | SIS2016-7 pp.35-40 |
| MSS | 2016-03-04 11:00 |
Yamaguchi | KAIKYO MESSE SHIMONOSEKI | CAME: A Novel Fast Connectivity-Aware MER Enumeration Algorithm for the Online Task Placement on Partially Reconfigurable Device Tieyuan Pan, Lian Zeng (Waseda Univ.), Yasuhiro Takashima (Univ. of Kitakyushu), Takahiro Watanabe (Waseda Univ.) MSS2015-82 |
In this paper, we propose a novel fast connectivity-aware Maximal Empty Rectangle(MER) enumeration algorithm for the onl... [more] | MSS2015-82 pp.79-84 |
| CQ | 2015-07-06 13:00 |
Nara | Nara Institute of Science and Technology | [Poster Presentation]
Path Enumeration Algorithm Using Zero-Suppressed Binary Decision Diagram for Path Selection in Overlay Networks Koki Sonoda, Jun Kawahara, Masahiro Sasabe, Shoji Kasahara (NAIST) CQ2015-29 |
For end-to-end communication in overlay networks, we need to quickly select an appropriate path from the viewpoints of t... [more] | CQ2015-29 pp.51-54 |
| RECONF | 2015-06-20 15:50 |
Kyoto | Kyoto University | An Online Task Placement Algorithm Based on MER Enumeration for Partially Reconfigurable Device Tieyuan Pan, Zhu Li, Lian Zeng, Takahiro Watanabe (Waseda Univ.), Yasuhiro Takashima (Univ. of Kitakyushu) RECONF2015-26 |
Recently, due to the development of technology, the embedded application becomes more and more complex. Consequently, no... [more] | RECONF2015-26 pp.141-146 |
[Return to Top Page]