Kyushu University Academic Staff Educational and Research Activities Database
List of Papers
Eiji Takimoto Last modified date:2018.06.11

Professor / Intelligence Science / Department of Informatics / Faculty of Information Science and Electrical Engineering


Papers
1. Ken-ichiro Moridomi, Kohei Hatano, Eiji Takimoto, Online Linear Optimization with the Log-Determinant Regularizer, IEICE Transactions on Information and Systems, 10.1587/transinf.2017EDP7317, E101-D, 6, 1511-1520, 2018.06.
2. Daiki Suehiro, Kohei Hatano, Eiji Takimoto, Efficient Reformulation of 1-Norm Ranking SVM, IEICE Transactions on Information and Systems, E101-D, 3, 719-729, 2018.03.
3. Takahiro Fujita, Kohei Hatano, Eiji Takimoto, Boosting over Non-deterministic ZDDs, Proceedings of the 12th International Conference and Workshops on Algorithms and Computation (WALCOM 2018), 10.1007/978-3-319-75172-6_17, 10755, 195-206, Lecture Notes in Computer Science, 2018.03.
4. Takumi Nakazono, Ken-ichiro Moridomi, Kohei Hatano, Eiji Takimoto, A Combinatorial Metrical Task System Problem Under the Uniform Metric, Proceedings of the 27th International Conference on Algorithmic Learning Theory (ALT 2017), 10.1007/978-3-319-46379-7_19, 9925, 1577-1586, 2016.10.
5. Nir Ailon, Kohei Hatano, Eiji Takimoto, Bandit Online Optimization Over the Permutahedron , Theoretical Computer Science, 10.1016/j.tcs.2016.07.033, 650, 92-108, 2016.10.
6. Takahiro Fujita, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Online Linear Optimization for Job Scheduling under Precedence Constraints, Proc. 26th International Conference on Algorithmic Learning Theory (ALT 2015), 10.1007/978-3-319-24486-0_22, 9355, 332-346, 2015.10.
7. Peter Bartlett, Wouter Koolen, Alan Malek, Eiji Takimoto, Manfred Warmuth, Minimax Fixed-Design Linear Regression, Proceedings of The 28th Conference on Learning Theory (COLT 2015), 40, 226-239, 2015.07.
8. Issei Matsumoto, Kohei Hatano, Eiji Takimoto, Online Density Estimation of Bradley-Terry Models, Proceedings of The 28th Conference on Learning Theory (COLT 2015) , 40, 1343-1359, 2015.07.
9. Kei Uchizawa, Eiji Takimoto, Lower bounds for linear decision trees with bounded weights, Proc. 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015), 10.1007/978-3-662-46078-8_34, 8939, 412-422, 2015.01.
10. Ken-ichiro Moridomi, Kohei Hatano, Eiji Takimoto, Online matrix prediction for sparse loss matrices, Proc. 6th Asian Conference on Machine Learning (ACML 2014), 39, 250-265, 2015.02.
11. Nir Ailon, Kohei Hatano, Eiji Takimoto, Bandit online optimization over permutahedron, Proc. 25th International Conference on Algorithmic Learning Theory (ALT 2014) , 10.1007/978-3-319-11662-4_16, 8776, 215-229, 2014.10.
12. Kazuki Teraoka, Kohei Hatano, Eiji Takimoto, Efficient Sampling Method for Monte Carlo Tree Search, IEICE Transactions on Information and Systems, E97-D, 3, 392-398, 2014.03.
13. Takahiro Fujita, Kohei Hatano, Eiji Takimoto, Combinatorial Online Prediction via Metarounding, 24th International Conference on Algorithmic Learning Theory (ALT 2013), 8139, 68-82, 2013.10.
14. Eiji Takimoto, Kohei Hatano, Efficient Algorithms for Combinatorial Online Prediction, 24th International Conference on Algorithmic Learning Theory (ALT 2013), 8139, 22-32, 2013.10.
15. Shota Yasutake, Kohei Hatano, Eiji Takimoto, Masayuki Takeda, Online Rank Aggregation, 4th Asian Conference on Machine Learning (ACML 2012), 25, 539-553, 2012.11.
16. Daiki Suehiro, Kohei Hatano, Shuji Kijima, Kiyohito Nagano, Eiji Takimoto, Online Prediction under Submodular Constraints, 23rd International Conference on Algorithmic Learning Theory (ALT 2012), 7568, 260-274, 2012.10.
17. Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda, Online Linear Optimization over Permutations, 22nd International Symposium on Algorithms and Computation (ISAAC 2011), LNCS, 7074, 534-543, 2011.12.
18. Shin-ichi Yoshida, Kohei Hatano, Eiji Takimoto, Masayuki Takeda, Adaptive Online Prediction Using Weighted Windows, IEICE Transactions on Information and Systems, E94-D, 10, 1917-1923, 2011.10.
19. Daiki Suehiro, Kohei Hatano, Eiji Takimoto, Approximate Reduction from AUC Maximization to 1-norm Soft Margin Optimization, 22nd International Conference on Algorithmic Learning Theory (ALT 2011), LNAI, 6925, 324-337, 2011.10.
20. Kei Uchizawa, Eiji Takimoto, Lower Bounds for Linear Decision trees via An Energy Complexity Argument, 36th International Symposiums on Mathematical Foundations of Computer Science (MFCS 2011), LNCS, 6907, 568-579, 2011.08.
21. Kei Uchizawa, Eiji Takimoto, Takao Nishizeki , Size–energy tradeoffs for unate circuits computing symmetric Boolean functions, Theoretical Computer Science, 10.1016/j.tcs.2010.11.022, 412, 773-782, 2011.03.
22. Kei Uchizawa, Takao Nishizeki, Eiji Takimoto, Energy and depth of threshold circuits, Theoretical Computer Science, 10.1016/j.tcs.2010.08.006, 411, 3938-3946, 2010.10.
23. Hideaki Fukuhara, Eiji Takimoto, Kazuyuki Amano, NPN-representatives of a Set of Optimal Boolean Formulas, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E-93A, 6, 2010.06.
24. Hideaki Fukuhara, Eiji Takimoto, Lower Bounds on Quantum Query Complexity for Read-once Formulas with XOR and MUX Operators, IEICE Transactions on Information and Systems, E-93D, 2, 280-289, 2010.02.
25. Kohei Hatano, Eiji Takimoto, Linear Programming Boosting by Column and Row Generation, 12th International Conference on Discovery Science (DS 2009), LNAI, 5808, 401-408, 2009.10.
26. Kei Uchizawa, Takao Nishizeki, Eiji Takimoto, Energy Complexity and Depth of Threshold Circuits, 17th International Symposium on Fundamentals of Computation Theory (FCS 2009), LNCS, 5699, 335-345, 2009.09.
27. Kei Uchizawa, Takao Nishizeki, Eiji Takimoto, Size and Energy of Threshold Circuits Computing Mod Functions, 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 2009), LNCS, 5734, 724-735, 2009.09.
28. Hideaki Fukuhara, Eiji Takimoto, Lower Bounds on Quantum Query Complexity for Read-once Formulas with XOR and MUX Operators
, Proceedings of the 2nd Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2009), 8-8, 2009.04.
29. Hideaki Fukuhara, Eiji Takimoto, Lower bounds on quantum query complexity for read-once decision trees with parity nodes, Computing: The Australasian Theory Symposium (CATS 2009), CRPIT, 94, 474-487, 2009.01.
30. Kei Uchizawa, Eiji Takimoto, Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity, Theoretical Computer Science, 407, 1-3, 474-487, 2008.11.
31. Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka, Monotone DNF Formula that has a Minimal or Maximal Number of Satisfying Assignments, The 14th Annual International Computing and Combinatorics Conference (COCOON), LNCS, 5092, 191-203, 2008.06.
32. Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masayuki Takeda, Smooth Boosting for Margin-Based Ranking, 19th International Conference on Algorithmic Learning Theory (ALT 2008), LNAI, 5254, 227-239, 2008.10.
33. Kei Uchizawa, Eiji Takimoto, Energy Complexity of Threshold Circuits, The First AAAC Annual Meeting , pp. 45-45, 2008.04.
34. Masashi Karasaki, Eiji Takimoto, On noise-reduction effect of filters for Boolean functions , The First AAAC Anual Meeting, pp.31-31, 2008.04.