| 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 | 2023-10-24 16:20 |
Aichi | Nagoya Univ. Venture Business Lab. (Aichi) | Algorithm of uniform deployment for mobile robots in perfect bipartite graphs Masahiro Shibata (Kyutech), Naoki Kitamura (Osaka Univ.), Ryota Eguchi (NAIST), Yuichi Sudo (Hosei Univ.), Junya Nakamura (Toyohashi Tech.), Yonghwan Kim, Yoshiaki Katayama (Nagoya Tech.), Toshimitsu Masuzawa (Osaka Univ.), Sebastien Tixeuil (Sorbonne Univ.)  COMP2023-14 |
In this paper, we consider the uniform deployment problem of mobile robots in perfect bipartite graphs. Intuitively, whe... [more] | COMP2023-14 pp.13-20 |
| COMP | 2022-03-06 16:00 |
Online | Online (Online) | Enumerating Labeled Graphs Under Given Constraints Using Answer Set Programming Yu Nakahata (NAIST) COMP2021-36 |
Enumeration of constrained graphs is important for both graph-theoretical study and testcase generation. We propose a me... [more] | COMP2021-36 pp.26-30 |
| IT, ISEC, WBS | 2016-03-11 11:40 |
Tokyo | The University of Electro-Communications (Tokyo) | Asymptotics Zero Error Capacity on Nearest Neighbor Error Channels with Multilevel Alphabet Takafumi Nakano, Tadashi Wadayama (NIT) IT2015-130 ISEC2015-89 WBS2015-113 |
This paper evaluates the zero error capacity of Nearest Neighbor Error channels with multilevel alphabet (NNE channels).... [more] | IT2015-130 ISEC2015-89 WBS2015-113 pp.175-180 |
| NLP, CAS | 2014-10-16 09:55 |
Ehime | Ehime University (Ehime) | The relation between equilibrium prices and socially optimal trades in electricity markets Ryo Hase, Norihiko Shinomiya (Soka Univ.) CAS2014-53 NLP2014-47 |
This paper presents a method to discover socially optimal trades in deregulated electricity markets consisting of four t... [more] | CAS2014-53 NLP2014-47 pp.13-16 |
| CAS, SIP, MSS, VLD, SIS [detail] | 2014-07-09 13:00 |
Hokkaido | Hokkaido University (Hokkaido) | A Price Setting Problem for Electricity Markets with Intermediaries Ryo Hase, Norihiko Shinomiya (Soka Univ.) CAS2014-8 VLD2014-17 SIP2014-29 MSS2014-8 SIS2014-8 |
This paper presents a price setting mechanism for competitive electricity markets consisting of independent power produc... [more] | CAS2014-8 VLD2014-17 SIP2014-29 MSS2014-8 SIS2014-8 pp.37-40 |
| IN, NV (Joint) |
2013-07-18 15:40 |
Hokkaido | Hokkaido Univ. Faculty of Eng. Academic Lounge 3 (Hokkaido) | [Invited Talk]
Fast Algorithms for Counting the Number of Paths in a Grid Graph Hiroaki Iwashita (JST) IN2013-44 |
A path in a graph, which is also referred to as a self-avoiding walk (SAW), is a way to go from a vertex to another vert... [more] | IN2013-44 pp.49-54 |
| 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 | 2012-09-03 16:10 |
Tokyo | Hosei University (Tokyo) | A New Direction for Counting Perfect Matchings Taisuke Izumi, Tadashi Wadayama (Nagoya Inst. of Tech.) COMP2012-33 |
We present a new exact algorithm for counting perfect matchings, which relies on neither inclusion-exclusion princip... [more] |
COMP2012-33 p.49 |
| COMP | 2011-12-16 10:00 |
Aichi | Nagoya Univ. (Aichi) | Relationship Between Coding Theory and Counting Perfect Matchings Taisuke Izumi, Tadashi Wadayama (NITech) COMP2011-37 |
Counting perfect matchings is known as one of the hard problems to obtain exact results, which is proven to be \#P-comp... [more] |
COMP2011-37 pp.9-15 |
| COMP | 2008-04-18 11:10 |
Osaka | Osaka Prefecture University (Osaka) | Enumeration of Perfect Sequences of Chordal Graph Yasuko Matsui (Tokai Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2008-3 |
A graph is chordal if and only if it has no chordless cycle of length more than three. The set of maximal cliques in a ... [more] |
COMP2008-3 pp.15-22 |
| RCS, AP, WBS, SR, MW, MoNA (Joint) |
2006-03-01 15:20 |
Kanagawa | YRP (Kanagawa) | Robust and Low Complexity Adaptive MIMO-OFDM Eigenmode Transmission System Seeho Ting, Haidoan Le, Kei Sakaguchi, Kiyomichi Araki (Tokyo Inst. of Tech.) |
In order to develop a practical and robust adaptive MIMO-OFDM Eigenmode Transmission System, consideration of the imper... [more] |
RCS2005-192 pp.85-90 |
| COMP | 2004-10-14 15:45 |
Miyagi | Tohoku University (Miyagi) | Multicoloring Unit Disk Graphs on Triangular Lattice Points Yuichiro Miyamoto (Sophia Univ.), Tomomi Matsui (Univ. Tokyo) |
In this paper, we discuss a necessary and sufficient condition that the unit disk graph on triangular lattice points is ... [more] | COMP2004-41 pp.49-54 |
[Return to Top Page]