| 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 # | |
| SP, IPSJ-SLP, EA, SIP [detail] | 2023-02-28 09:30 |
Okinawa | (Primary: On-site, Secondary: Online) |
A Study on Designing Hopping Patterns Based on Euler Graphs for Inaudible Sound Communication Systems Naofumi Aoki, Kosei Ozeki (Hokkaido Univ.), Kenichi Ikeda, Hiroshi Yasuda, Hiroyuki Namba (SST)  EA2022-80 SIP2022-124 SP2022-44 |
The inaudible sound communication system of our implementation estimates the correct positions of received symbols for t... [more] | EA2022-80 SIP2022-124 SP2022-44 pp.31-34 |
| IA, IN (Joint) |
2018-12-14 15:05 |
Hiroshima | Hiroshima Univ. | A Structured Overlay Network Based on a Proximity-aware Distributed Line Graph Youki Shiraishi (NAIST), Akiko Manada (Shonan Inst. of Tech.), Yuzo Taenaka, Youki Kadobayashi (NAIST) IA2018-51 |
A distributed line graph (DLG) is a technique for designing a structured overlay network based on an arbitrary regular g... [more] | IA2018-51 pp.71-77 |
| COMP | 2018-12-12 17:05 |
Miyagi | Tohoku University | Experimental evaluation of an approach based on de Bruijn graphs for Order/Degree problem Tamami Okada, Hiroki Kanda, Yosuke Kikuchi (NIT, Tsuyama College) COMP2018-41 |
In 1946, de Bruijn digraphs was proposed by mathematician de Bruijn. This paper describes the smallest diameter graph c... [more] |
COMP2018-41 pp.61-67 |
| MBE, NC, NLP (Joint) |
2018-01-26 13:25 |
Fukuoka | Kyushu Institute of Technology | Methods for Constructing Simple Undirected Regular Graphs Based on Generalized de Bruijn Graphs Ryoya Ishii, Norikazu Takahashi (Okayama Univ.) NLP2017-90 |
The Generalized de Bruijn Graphs (GDBG) are a class of directed regular graphs. Since the average shortest path length o... [more] | NLP2017-90 pp.23-28 |
| COMP, IPSJ-AL | 2017-05-13 15:50 |
Nagasaki | On Equivalence of de Bruijn Graphs and State-minimized Finite Automata Yoshiaki Takahashi (Solar), Akira Ito (Yamaguchi Univ.) COMP2017-11 |
A de Bruijn sequence of order n on the alphabet {0,1} is a cyclic sequence in which every possible string of length n ov... [more] | COMP2017-11 pp.77-83 |
|
| MSS, SS | 2015-01-26 16:15 |
Tottori | A Two Phase Scheme for De Novo Genome Assembly based on de Bruijn Graphs for Multiple Short Read Sets Takuto Shigenobu, Morikazu Nakamura (Univ. of the Ryukyus) MSS2014-75 SS2014-39 |
We propose a two phase scheme for de novo genome assembly based on de Bruijn graphs. Given multiple short read sets obt... [more] |
MSS2014-75 SS2014-39 pp.37-41 |
|
| COMP | 2012-09-03 11:25 |
Tokyo | Hosei University | Compressing de Bruijn Graphs Alexander Bowe (NII), Taku Onodera (Univ. of Tokyo), Kunihiko Sadakane (NII), Tetsuo Shibuya (Univ. of Tokyo) COMP2012-29 |
We propose a new succinct de Bruijn graph representation. If the de Bruijn graph of $k$-mers in a DNA sequence of len... [more] |
COMP2012-29 pp.25-32 |
| NS, IN (Joint) |
2010-03-05 09:30 |
Miyazaki | Miyazaki Phoenix Seagaia Resort (Miyazaki) | A Degree Constrained Broadcast Algorithm on a Structured P2P Network Yuki Hanazawa, Yusuke Sasaki, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2009-207 |
In this paper, we propose two algorithms for broadcasting a large data set with limited loads of all nodes on a DHT-base... [more] | NS2009-207 pp.259-264 |
| COMP | 2009-03-02 11:10 |
Tokyo | Tokyo Institute of Technology | Factorization of Generalized de Bruijn and Kautz Digraphs using Loop-Rooted Trees Takahiro Tsuno, Yukio Shibata (Gunma Univ.) COMP2008-57 |
In this research, we present several factorizations of generalized de Bruijn digraphs and generalized Kautz digraphs bas... [more] | COMP2008-57 pp.25-32 |
| DC | 2009-02-16 16:10 |
Tokyo | A Secure Scan Design Approach using Extended de Bruijn Graph Hideo Fujiwara, Marie Engelene J. Obien (NAIST) DC2008-78 |
Scan design makes digital circuits easily testable, however, it can also be exploited to be used for hacking the chip. T... [more] | DC2008-78 pp.61-66 |
|
| NS, IN (Joint) |
2007-03-09 14:10 |
Okinawa | Okinawa Convention Center | A construction method of P2P network with small degree and diameter and performance evaluation Yusuke Sasaki, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2006-240 |
Recently, P2P(Peer-to-Peer) networks are expected to be used in fields such as distributed storage systems, and so on. ... [more] | IN2006-240 pp.357-362 |
| IN, RCS (Joint) |
2006-05-19 10:50 |
Tokyo | An overlay network with small degree and diameter for P2P systems Yusuke Sasaki, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2006-11 |
Recently, P2P(Peer-to-Peer) systems are in the spotlight instead of client/server systems. P2P technology is expected t... [more] | IN2006-11 pp.61-66 |
|
[Return to Top Page]