| 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 | 2014-04-24 10:55 |
Miyagi | Tohoku University (Miyagi) | Swapping Labeled Tokens on Graphs Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takehiro Ito (Tohoku Univ.), Jun Kawahara (NAIST), Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Kei Uchizawa (Yamagata Univ.), Takeaki Uno (NII)  COMP2014-2 |
[more] | COMP2014-2 pp.5-12 |
| COMP, IPSJ-AL | 2013-05-18 09:55 |
Hokkaido | Otaru University of Commerce (Hokkaido) | Complexity of Counting Output Patterns of Logic Circuits Kei Uchizawa (Yamagata Univ.), Zhenghong Wang (Tohoku Univ.), Hiroki Morizumi (Shimane Univ.), Xiao Zhou (Tohoku Univ.) COMP2013-14 |
Let $C$ be a logic circuit consisting of $s$ gates $g_1, g_2, dots , g_s$, then the output pattern of $C$ for an input... [more] |
COMP2013-14 pp.97-102 |
| COMP | 2012-03-16 10:55 |
Tokyo | Univ. of Tokyo (Tokyo) | Computational Complexity of Competitive Diffusion on Graphs Hisayuki Satoh, Kei Uchizawa, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2011-49 |
[more] | COMP2011-49 pp.17-22 |
| COMP, IPSJ-AL | 2011-09-06 15:40 |
Hokkaido | Hakodate City Central Library (Hokkaido) | Lower Bounds for Linear Decision Trees via An Energy Complexity Argument Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.) COMP2011-26 |
A linear decision tree is a binary decision tree in which a classification rule at each internal node is defined by a ... [more] |
COMP2011-26 pp.67-73 |
| COMP | 2010-12-03 11:05 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology (Fukuoka) | Energy-Efficient Threshold Circuits Computing Mod Functions Akira Suzuki, Kei Uchizawa, Xiao Zhou (Tohoku Univ.) COMP2010-40 |
We prove that the modulus function MOD$_m$ of $n$ variables can be computed by a threshold circuit $C$ of energy $e$ a... [more] |
COMP2010-40 pp.7-13 |
| COMP | 2010-01-25 16:10 |
Fukuoka | Nishijin Plaza, Kyushu University (Fukuoka) | Size-Energy Tradeoff of Unate Circuits Computing Symmetric Functions Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) COMP2009-47 |
A unate gate is a logical gate computing a unate Boolean function. Examples of unate gates are AND-gates, OR-gates, NO... [more] |
COMP2009-47 pp.57-64 |
| COMP | 2009-04-17 13:30 |
Kyoto | Kyoto Univ. (Kyoto) | Energy Complexity and Depth of Threshold Circuits Kei Uchizawa, Takao Nishizeki (Tohoku Univ.) COMP2009-4 |
Suppose that a Boolean function $f$ can be computed by a threshold circuit $C$ of energy complexity $e$. Thus, at most... [more] |
COMP2009-4 pp.21-28 |
| COMP | 2008-10-10 15:15 |
Miyagi | Tohoku Univ. (Miyagi) | Size-Energy Tradeoff for Threshold Logic Circuits Computing MOD Functions Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) COMP2008-42 |
A threshold logic circuit $C$ computing a Boolean function MOD$_m: \{ 0，1\}^n \to \{0, 1\}$ outputs ``0'' if the number ... [more] | COMP2008-42 pp.63-69 |
| COMP | 2006-10-17 16:15 |
Miyagi | Tohoku University (Miyagi) | An Exponentioal Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity Kei Uchizawa, Eiji Takimoto (Tohoku Univ.) |
[more] | COMP2006-40 pp.71-76 |
| COMP | 2005-03-18 11:15 |
Tokyo | Tokyo Institute of Technology (Tokyo) | An Energy Conplexity of Threshold Circuits Kei Uchizawa (Tohoku Univ.), Wolfgang Maass (Tech. Univ. Graz) |
In this article we propose new complexity measure, {\it energy complexity}, for artificial circuits of threshold gates (... [more] | COMP2004-78 pp.39-47 |
[Return to Top Page]