SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Eiji Takimoto: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Shigeaki Harada, Eiji Takimoto, Akira Maruoka
Online Allocation with Risk Information. [Citation Graph (0, 0)][DBLP]
ALT, 2005, pp:343-355 [Conf]
Akira Maruoka, Eiji Takimoto
Structured Weight-Based Prediction Algorithms. [Citation Graph (0, 0)][DBLP]
ALT, 1998, pp:127-142 [Conf]
Akira Miyashiro, Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka
Learning Orthogonal F-Horn Formulas. [Citation Graph (0, 0)][DBLP]
ALT, 1995, pp:110-122 [Conf]
Eiji Takimoto, Ken'ichi Hirai, Akira Maruoka
A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree. [Citation Graph (0, 0)][DBLP]
ALT, 1997, pp:385-400 [Conf]
Eiji Takimoto, Syuhei Koya, Akira Maruoka
Boosting Based on Divide and Merge. [Citation Graph (0, 0)][DBLP]
ALT, 2004, pp:127-141 [Conf]
Eiji Takimoto, Akira Maruoka
On the Sample Complexity of Consistent Learning with One-Sided Error. [Citation Graph (0, 0)][DBLP]
ALT, 1993, pp:265-278 [Conf]
Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka
Learnability of Exclusive-Or Expansion Based on Monotone DNF Formulas. [Citation Graph (0, 0)][DBLP]
ALT, 1996, pp:12-25 [Conf]
Eiji Takimoto, Ichiro Tajika, Akira Maruoka
Mutual Information Gaining Algorithm and Its Relation to PAC-Learning Algorithm. [Citation Graph (0, 0)][DBLP]
AII/ALT, 1994, pp:547-559 [Conf]
Eiji Takimoto, Manfred K. Warmuth
The Last-Step Minimax Algorithm. [Citation Graph (0, 0)][DBLP]
ALT, 2000, pp:279-290 [Conf]
Eiji Takimoto, Manfred K. Warmuth
Predicting Nearly as well as the best Pruning of a Planar Decision Graph. [Citation Graph (0, 0)][DBLP]
ATL, 1999, pp:335-346 [Conf]
Shigeaki Harada, Eiji Takimoto, Akira Maruoka
Aggregating Strategy for Online Auctions. [Citation Graph (0, 0)][DBLP]
COCOON, 2006, pp:33-41 [Conf]
Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka
Proper Learning Algorithm for Functions of k Terms Under Smooth Distributions. [Citation Graph (0, 0)][DBLP]
COLT, 1995, pp:206-213 [Conf]
Eiji Takimoto, Akira Maruoka
Conservativeness and Monotonicity for Learning Algorithms. [Citation Graph (0, 0)][DBLP]
COLT, 1993, pp:377-383 [Conf]
Eiji Takimoto, Manfred K. Warmuth
The Minimax Strategy for Gaussian Density Estimation. pp. [Citation Graph (0, 0)][DBLP]
COLT, 2000, pp:100-106 [Conf]
Eiji Takimoto, Manfred K. Warmuth
Path Kernels and Multiplicative Updates. [Citation Graph (0, 0)][DBLP]
COLT, 2002, pp:74-89 [Conf]
Jun Mizuno, Tasuya Watanabe, Kazuya Ueki, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka
On-Line Estimation of Hidden Markov Model Parameters. [Citation Graph (0, 0)][DBLP]
Discovery Science, 2000, pp:155-169 [Conf]
Eiji Takimoto, Akira Maruoka
On the Boosting Algorithm for Multiclass Functions Based on Information-Theoretic Criterion for Approxiamtion. [Citation Graph (0, 0)][DBLP]
Discovery Science, 1998, pp:256-267 [Conf]
Akira Maruoka, Eiji Takimoto
On-Line Algorithm to Predict Nearly as Well as the Best Pruning of a Decision Tree. [Citation Graph (0, 0)][DBLP]
Progress in Discovery Science, 2002, pp:296-306 [Conf]
Eiji Takimoto, Akira Maruoka
Top-Down Decision Tree Boosting and Its Applications. [Citation Graph (0, 0)][DBLP]
Progress in Discovery Science, 2002, pp:327-337 [Conf]
Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka
Proper Learning Algorithm for Functions of k Terms under Smooth Distributions. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1999, v:152, n:2, pp:188-204 [Journal]
Eiji Takimoto, Manfred K. Warmuth
Path Kernels and Multiplicative Updates. [Citation Graph (0, 0)][DBLP]
Journal of Machine Learning Research, 2003, v:4, n:, pp:773-818 [Journal]
Eiji Takimoto, Akira Maruoka
Top-down decision tree learning as information based boosting. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:292, n:2, pp:447-464 [Journal]
Eiji Takimoto, Akira Miyashiro, Akira Maruoka, Yoshifumi Sakai
Learning Orthogonal F-Horn Formulas. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1997, v:185, n:1, pp:177-190 [Journal]
Eiji Takimoto, Akira Maruoka, Volodya Vovk
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2001, v:261, n:1, pp:179-209 [Journal]
Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka
The learnability of exclusive-or expansions based on monotone DNF formulas. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:241, n:1-2, pp:37-50 [Journal]
Eiji Takimoto, Manfred K. Warmuth
Predicting nearly as well as the best pruning of a planar decision graph. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2002, v:288, n:2, pp:217-235 [Journal]
Ricard Gavaldà, Eiji Takimoto
Foreword. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:364, n:1, pp:1-2 [Journal]
Marcus Hutter, Rocco A. Servedio, Eiji Takimoto
Editors' Introduction. [Citation Graph (0, 0)][DBLP]
ALT, 2007, pp:1-8 [Conf]
Kei Uchizawa, Eiji Takimoto
An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity. [Citation Graph (0, 0)][DBLP]
IEEE Conference on Computational Complexity, 2007, pp:169-178 [Conf]
Evaluation of Multi-Channel Flooding for Inter-Vehicle Communication. [Citation Graph (, )][DBLP]
Smooth Boosting for Margin-Based Ranking. [Citation Graph (, )][DBLP]
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. [Citation Graph (, )][DBLP]
Linear Programming Boosting by Column and Row Generation. [Citation Graph (, )][DBLP]
Energy Complexity and Depth of Threshold Circuits. [Citation Graph (, )][DBLP]
Size and Energy of Threshold Circuits Computing Mod Functions. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.302secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP