| 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.) |
(To be available after the conference date) [more] | |
| 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 |
| 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 |
| 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 |
[Return to Top Page]