| 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 # | |
| IBISML | 2014-03-07 10:30 |
Nara | Nara Women's University | Online Matrix Prediction with Log-Determinant Regularizer Kenichiro Moridomi, Kohei Hatano, Eiji Takimoto (Kyushu Univ.), Koji Tsuda (AIST)  IBISML2013-75 |
We consider an online symmetric positive semi-definite matrix prediction problem with convex loss function and Frobenius... [more] | IBISML2013-75 pp.63-70 |
| MoNA, IN (Joint) |
2013-11-22 10:35 |
Kumamoto | Kumamoto University | Improving the Suppression Method of Redundant TCP Retransmission Caused by Route Modification Shuhei Aketa, Yuto Otsuki, Koichi Mouri, Eiji Takimoto (Ritsumeikan Univ.) MoNA2013-46 |
Link state routing protocols modify routes according to the change of link quality. The route modification improves comm... [more] | MoNA2013-46 pp.29-34 |
| CQ | 2013-07-12 10:50 |
Hokkaido | Hokkaido University | A Method Based on Difference among Sequence Numbers to Suppress Redundant TCP Retransmission Caused by Route Modification Shuhei Aketa, Yuto Otsuki, Koichi Mouri, Eiji Takimoto (Ritsumeikan Univ.) CQ2013-24 |
Link state routing protocols modify routes according to the change of link quality.Route modification improves communica... [more] | CQ2013-24 pp.61-66 |
| IBISML | 2013-03-04 14:15 |
Aichi | Nagoya Institute of Technology | Passive-Aggressive Algorithm with Bias Daigo Tateishi, Kohei Hatano, Eiji Takimoto (Kyushu Univ.) IBISML2012-93 |
We consider online binary classi cation problems by using linear classi ers. Among online learning algorithms for linea... [more] |
IBISML2012-93 pp.1-8 |
| IN, IA (Joint) |
2012-12-14 09:20 |
Hiroshima | Hiroshima City Univ. | Application of Network Coding Technique to TCP Communications in Wireless Multi-hop Networks Kaiei Ko, Eiji Takimoto, Koichi Mouri (Ritsumeikan Univ.) IN2012-129 |
TCP communications on wireless multi-hop networks have properties of traffic and inference increase with acknowledgement... [more] | IN2012-129 pp.45-50 |
| IBISML | 2012-11-08 15:00 |
Tokyo | Bunkyo School Building, Tokyo Campus, Tsukuba Univ. | Efficient AUC Maximization by Approximate Reduction of Ranking SVMs Daiki Suehiro, Kohei Hatano, Eiji Takimoto (Kyushu Univ.) IBISML2012-68 |
[more] | IBISML2012-68 pp.243-249 |
| IBISML | 2012-06-19 11:00 |
Kyoto | Campus plaza Kyoto | Online Prediction under Submodular Constraints Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto (Kyushu Univ.), Kiyohito Nagano (Tokyo Univ.) IBISML2012-3 |
[more] | IBISML2012-3 pp.15-22 |
| IBISML | 2011-11-09 15:45 |
Nara | Nara Womens Univ. | Approximate Reduction from AUC Maximization to 1-norm Soft Margin Optimization Daiki Suehiro, Kohei Hatano, Eiji Takimoto (Kyushu Univ.) IBISML2011-48 |
Finding linear classifi ers that maximize AUC scores is important in ranking research. This is naturally formulated as ... [more] |
IBISML2011-48 pp.39-46 |
| COMP, IPSJ-AL | 2011-09-06 15:40 |
Hokkaido | Hakodate City Central Library | 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 |
| IBISML | 2010-11-04 15:00 |
Tokyo | IIS, Univ. of Tokyo | [Poster Presentation]
Learning Evaluation Functions for Shogi Using SVM-based Bipartite Ranking Learning Daiki Suehiro, Kohei Hatano, Hideo Bannai, Eiji Takimoto, Masayuki Takeda (Kyushu Univ.) IBISML2010-74 |
Recently, automatic optimization of parameters by applying machine learning methods has become a mainstream approach for... [more] | IBISML2010-74 pp.113-118 |
| COMP | 2010-01-25 16:10 |
Fukuoka | Nishijin Plaza, Kyushu University | 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-03-02 09:10 |
Tokyo | Tokyo Institute of Technology | Generating NPN-representatives of a Set of Optimal Boolean Formulas Hideaki Fukuhara (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Kazuyuki Amano (Gunma Univ.) COMP2008-54 |
For $k$ variable function $h$ and $k$ functions $g_1, \ldots, g_k$, $f = h \circ (g_1, \ldots, g_k)$denotes a composit... [more] |
COMP2008-54 pp.1-8 |
| COMP | 2008-10-10 14:00 |
Miyagi | Tohoku Univ. | Lower bounds on quantum query complexity for decision trees Hideaki Fukuhara (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.) COMP2008-40 |
[more] | COMP2008-40 pp.47-54 |
| COMP | 2008-10-10 15:15 |
Miyagi | Tohoku Univ. | 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 | 2008-03-10 16:45 |
Kanagawa | Multiplicative Weight Update Algorithm for Metrical Task Systems Shingo Kawabata, Eiji Takimoto (Tohoku Univ.) COMP2007-66 |
Multiplicative weight update algorithms work very well for various online prediction problems. We apply the method to a... [more] |
COMP2007-66 pp.75-82 |
|
| IPSJ-AVM, MoNA | 2007-07-20 15:25 |
Niigata | Niigata Univ. | Simulation-based Evaluation of Multi-channel Flooding Yoshihisa Kondo, Satoko Itaya, Eiji Takimoto, Peter Davis, Ryutaro Suzuki, Sadao Obana (ATR) MoMuC2007-42 |
Inter-vehicle communication with IEEE802.11 ad hoc networks is expected to achieve high speed data exchange for safe dri... [more] | MoMuC2007-42 pp.103-108 |
| IN | 2007-07-20 15:10 |
Hyogo | Kobe University | An Implementation and Evaluations of Multi-channel Flooding Eiji Takimoto, Yoshihisa Kondo, Satoko Itaya, Ryutaro Suzuki, Sadao Obana (ATR) IN2007-42 |
Ad hoc network technology is effective to realize inter-vehicle communications. And delivering data packets to all vehic... [more] | IN2007-42 pp.91-94 |
| COMP | 2007-05-25 11:15 |
Fukuoka | Kyushu University | On noise-reduction effect of filters for Boolean functions Masashi Karasaki, Eiji Takimoto (Tohoku Univ.) COMP2007-12 |
[more] | COMP2007-12 pp.7-12 |
| COMP | 2006-03-23 09:35 |
Tokyo | The University of Electro-Communications | Complexity of the pairing strategy for Shannon switching game Ryosuke Takahashi, Eiji Takimoto, Akira Maruoka (Tohoku Univ.) |
Shannon switching game is a game where two players alternately place stones on the vertices of a given graph. The first ... [more] | COMP2005-64 pp.7-14 |
| COMP | 2005-10-18 11:00 |
Miyagi | Tohoku Univ. | Margin Preserving Projection with Limited Randomness and Embedding to Boolean Space Tatsuya Watanabe, Eiji Takimoto, Kazuyuki Amano, Akira Maruoka (Tohoku Univ.) |
Learning large margin classifiers is one of the most important problems in machine learning. However, it is hard to fin... [more] |
COMP2005-39 pp.21-28 |
[Return to Top Page]