| 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 | 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 |
| NLP, CAS | 2014-10-16 10:15 |
Ehime | Ehime University | Enumerating and Indexing of Polyiamonds for p6 Tiling by Using ZDDs Tomoki Nozawa, Toshihiko Takahashi (Niigata Univ.) CAS2014-54 NLP2014-48 |
A p6 tiling is a plane tiling by 6-fold rotational copies of a single figure. A polyiamond or n-iamond is a figure cons... [more] |
CAS2014-54 NLP2014-48 pp.17-22 |
| 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 |
| COMP, IPSJ-AL | 2014-06-14 13:55 |
Ehime | Matsuyama, Ehime | Enumeration of Polyominoes for pmg Tiling Jun Nishioka, Takashi Horiyama (Saitama Univ.) COMP2014-14 |
Polyominoes are the two dimensional shapes made by connecting n equal-sized squares, joined along their edges. In this p... [more] | COMP2014-14 pp.107-114 |
| COMP, IPSJ-AL | 2013-05-17 15:05 |
Hokkaido | Otaru University of Commerce | 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 |
| IT, ISEC, WBS | 2013-03-07 13:40 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Maximum Redundancy of Lossless Data Compression via Substring Enumeration for Markov Sources Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. Tech.), Yuki Shima (Univ. of Fukui) IT2012-76 ISEC2012-94 WBS2012-62 |
Dub\'{e} and Beaudoin proposed a technique of lossless data compression called compression via substring enumeration (CS... [more] | IT2012-76 ISEC2012-94 WBS2012-62 pp.95-100 |
| QIT (2nd) |
2012-11-27 - 2012-11-28 |
Kanagawa | Keio Univ. Hiyoshi Campus | [Poster Presentation]
Quantum Query Complexity on Enumerating Collisions Masahide Yamato (Osaka Pref Univ.), Harumichi Nishimura (Nagoya Univ.) |
A collision of a function $f$ (i.e. a pair $(x,y)$ such that $f(x)=f(y)$) is one of the basic concepts on a function. Th... [more] | |
| 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 |
| 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 |
| COMP | 2012-06-21 09:30 |
Hokkaido | Hokkaido University | Generalization of ZDD Construction Algorithms for Enumerating and Indexing the Solutions of Combinatorial Problems Jun Kawahara (JST), Shin-ichi Minato (Hokkaido Univ.) COMP2012-12 |
There are various combinatorial problems whose solutions can be represented as a family of sets. The Zero-suppressed Bi... [more] | COMP2012-12 pp.1-7 |
| NC | 2012-01-27 15:00 |
Hokkaido | Future University Hakodate | The M-best Discrete Optimization Method for Sparsely Connected Multi-body Model Masashi Kato, Masato Inoue (Waseda Univ.) NC2011-118 |
In this report, we propose an efficient method for obtaining exact M-best solutions of a discrete optimization problem (... [more] | NC2011-118 pp.125-130 |
| CAS, MSS | 2011-11-18 14:45 |
Yamaguchi | Univ. of Yamaguchi | A Recurrence for the Number of Baxter Permutations via Rectangular Partition Toshihiko Takahashi (Niigata Univ.) CAS2011-84 MSS2011-53 |
A rectangular partition is a subdivision of a rectangle into rectangles by horizontal and vertical line segments. Enume... [more] |
CAS2011-84 MSS2011-53 pp.119-122 |
| IN, NV (Joint) |
2011-07-21 17:10 |
Hokkaido | Hokkaido University | Entwork Reliability Evaluation Using Efficient Path Enumeration ALgorithms Toshiki Saitoh, Jun Kawahara, Ryo Yoshinaka, Takeru Inoue (JST), Shin-ichi Minato (Hokkaido Univ.) IN2011-55 |
Recently, novel algorithms that enumerate all possible paths on a graph have been proposed. They commonly take advantage... [more] | IN2011-55 pp.57-62 |
| COMP | 2011-05-11 14:30 |
Nagano | Shinshu Univ. | Edge-Unfoldings of Platonic Solids Never Overlap Takashi Horiyama, Wataru Shoji (Saitama Univ.) COMP2011-14 |
We solve an open problem for hundreds of years: Is every edge-unfolding of Platonic solids nonoverlapping? The answer ... [more] |
COMP2011-14 pp.17-23 |
| MSS | 2010-08-02 14:50 |
Ishikawa | A Method for Obtainning Discrete System from Steady-State Continuous System Tadashi Matsumoto, Masahiro Osogami (Fukui Univ. of Tech.), Seiichiro Moro (Univ. of Fukui) CST2010-34 |
From the given continuous system$Ax = b ( A = [ a_{ij}] \in R^{m \times n}, b = [ b_i] \in R^{m \times 1}), $proposals f... [more] | CST2010-34 pp.13-18 |
|
| COMP | 2010-01-25 13:35 |
Fukuoka | Nishijin Plaza, Kyushu University | Enumerating Rooted and Triangulated Planar Graphs Bingbing Zhuang, Hiroshi Nagamochi (Kyoto Univ.) COMP2009-43 |
A graph is called a triangulated planar graph if it admits a plane embedding in the plane such that all inner faces ... [more] |
COMP2009-43 pp.29-36 |
| COMP | 2009-09-14 15:05 |
Tottori | Tottori University of Environmental Studies | Random Generation and Enumeration of Bipartite Permutation Graphs Toshiki Saitoh (JAIST), Yota Otachi (Gunma Univ.), Katsuhisa Yamanaka (Univ. of Electro-Comm), Ryuhei Uehara (JAIST) COMP2009-30 |
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite ... [more] |
COMP2009-30 pp.35-42 |
| COMP | 2009-05-26 15:40 |
Saitama | Saitama Univ. | Listing All st-Orientation Andry Setiawan, Shin-ichi Nakano (Gunma Univ.) COMP2009-16 |
In this paper we give a simple algorithm to generate all st-orientations of a given biconnected plane graph G with des... [more] |
COMP2009-16 pp.45-50 |
| COMP | 2009-05-26 16:15 |
Saitama | Saitama Univ. | Enumeration of Polyominoes for p4 Tiling Takashi Horiyama, Masato Samejima (Saitama Univ.) COMP2009-17 |
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper,... [more] |
COMP2009-17 pp.51-55 |
[Return to Top Page]