| 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 | 2024-05-09 10:45 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Depth-Three Circuits for Inner Product and Majority Functions Kazuyuki Amano (Gunma Univ.)  COMP2024-4 |
A $Sigma_3^k$-circuit is a depth-three OR $circ$ AND $circ$ OR circuit in which each bottom gate has fan-in at most $k$.... [more] | COMP2024-4 p.9 |
| IT, ISEC, RCC, WBS | 2022-03-11 14:55 |
Online | Online | On Strong Converse Theorem for Distributed Hypothesis Testing Yasutada Oohama (UEC) IT2021-122 ISEC2021-87 WBS2021-90 RCC2021-97 |
In this study, we consider a communication system in which data generated at two points with correlation is separatley... [more] |
IT2021-122 ISEC2021-87 WBS2021-90 RCC2021-97 pp.228-233 |
| R | 2019-07-26 14:00 |
Iwate | Ichinoseki Cultural Center | Limit theorem of a connected-(r,s)-out-of-(m,n):F lattice system Koki Yamada, Taishin Nakamura, Hisashi Yamamoto, Lei Zhou, Xiao Xiao (Tokyo Met. Univ.) R2019-14 |
In previous studies, several methods for computing the reliability of a connected-(r,s)-out-of-(m,n):F lattice system ha... [more] | R2019-14 pp.1-6 |
| COMP | 2018-10-26 15:00 |
Kyoto | Kyoto University | Upper and lower bounds on the OBDD-width of a special integer multiplication Tong Qin (Tokyo Tech) COMP2018-27 |
We consider a Boolean function ${rm SMul}_{n-1}^n$ that computes the middle bit of the multiplication of two natural num... [more] | COMP2018-27 pp.45-54 |
| ICTSSL | 2018-07-18 09:00 |
Tokyo | NTT Musashino R&D Center | Relationship between graph coloring and channel assignment in wireless communication Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2018-20 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] | ICTSSL2018-20 pp.23-27 |
| ICTSSL | 2016-06-15 13:50 |
Miyagi | Tohoku University | On the number of channels in wireless networks from the standpoint of graph colorings Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2016-15 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] | ICTSSL2016-15 pp.85-90 |
| COMP | 2015-10-02 10:00 |
Tokyo | Upper and lower bounds and time complexities on the Frobenius problem obtained from analysing its additive structure Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2015-22 |
In this work, we investigate upper and lower bounds for the Frobenius problem, using some existing results in additive c... [more] | COMP2015-22 pp.1-5 |
|
| COMP | 2011-06-30 14:40 |
Hiroshima | Hiroshima Univ. | On the Constant Depth Circuit Complexity of Subgraph Isomorphism on Random Graphs Koutarou Nakagawa (Tokyo Inst. of Tech.) COMP2011-20 |
The AC$^0$ circuit complexity of $k$-clique on random graphs is already known. Rossman established the lower bound $n^{\... [more] | COMP2011-20 pp.33-37 |
| NS, RCS (Joint) |
2010-12-17 11:30 |
Okayama | Okayama Univ. | Channel Capacity on Multi-hop MIMO Relay System Pham Thanh Hiep (Yokohama National Univ.), Nguyen Huy Hoang (Le Quy Don Univ.), Ryuji Kohno (Yokohama National Univ.) RCS2010-187 |
Multiple-input multiple-output (MIMO) relay systems have been discussed in several published papers. When a relay node... [more] |
RCS2010-187 pp.169-174 |
| SAT, RCS (Joint) |
2010-08-27 14:00 |
Kagoshima | Kagoshima Univ. | A study on spectrum sharing technique using channel occupancy rate Tahseen Kazmi, Kenta Umebayashi, Yukihiro Kamiya, Yasuo Suzuki (Tokyo Univ. of Agr and Tech.) RCS2010-101 |
This paper presents a spectrum sharing technique based on the Channel Occupancy Rate(COR)information of the Primary User... [more] | RCS2010-101 pp.135-140 |
| MSS | 2009-01-29 13:00 |
Kanagawa | Kanagawa Industrial Promotion Center | On Upper and Lower Bounds of Optimal Execution Time of Task Graph by Considering Communication Delays Takashi Otsuka, Masato Nakahara, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.), Yuu Moriyama, Hirotoshi Tonou (Fujitsu TEN Limited) CST2008-41 |
This paper deals with upper and lower bounds of optimal execution time of task graphs that are supposed to be executed i... [more] | CST2008-41 pp.1-4 |
| COMP | 2008-10-10 14:30 |
Miyagi | Tohoku Univ. | Partitioning a Weighted Tree to Subtrees of Almost Uniform Size Takehiro Ito (Tohoku Univ.), Takeaki Uno (NII), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) COMP2008-41 |
Assume that each vertex of a graph $G$ is assigned a nonnegative integer weight and that $l$ and $u$ are integers such t... [more] | COMP2008-41 pp.55-61 |
| DE | 2008-09-21 17:00 |
Fukushima | [Poster Presentation]
SPIRAL:Efficient and Exact Model Identification for Hidden Markov Models Yasuhiro Fujiwara, Yasushi Sakurai, Masashi Yamamuro (NTT) DE2008-32 |
The goal of this work is to identify efficiently and correctly the model in a given dataset that yields the state sequ... [more] |
DE2008-32 pp.5-6 |
|
| COMP | 2005-09-15 15:10 |
Osaka | Osaka Univ., Toyonaka Campus | An algorithm for generating vertex sequences to extract maximum weight cliques quickly Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
Given an undirected graph with weight for each vertex, the maximum weight clique problem is to find the clique of the ... [more] |
COMP2005-33 pp.39-42 |
| PRMU | 2004-09-10 - 2004-09-11 |
Kyoto | A Vector Set Similarity Measure based on Bi-directional Mapping and Its Upper Bounds Takanori Yokoyama, Toshinori Watanabe, Hisashi Koga (UEC) |
We have proposed a fractal code retrieval method. There, we interpreted a fractal code as a vector set, and introduced... [more] |
||
[Return to Top Page]