Eiji Takimoto

From MaRDI portal
Revision as of 01:30, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Eiji Takimoto to Eiji Takimoto: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:329615

Available identifiers

zbMath Open takimoto.eijiMaRDI QIDQ329615

List of research outcomes

PublicationDate of PublicationType
Learning orthogonal F-Horn formulas2023-12-08Paper
Improved algorithms for online load balancing2022-03-24Paper
Decision diagrams for solving a job scheduling problem under precedence constraints2020-12-16Paper
Theory and Algorithms for Shapelet-Based Multiple-Instance Learning2020-11-02Paper
Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints2020-02-25Paper
Boosting over non-deterministic ZDDs2020-01-16Paper
Boosting over non-deterministic ZDDs2018-06-15Paper
Online Linear Optimization for Job Scheduling Under Precedence Constraints2016-11-30Paper
A Combinatorial Metrical Task System Problem Under the Uniform Metric2016-11-09Paper
Bandit online optimization over the permutahedron2016-10-21Paper
Lower Bounds for Linear Decision Trees with Bounded Weights2015-02-20Paper
Bandit Online Optimization over the Permutahedron2015-01-14Paper
Efficient Algorithms for Combinatorial Online Prediction2013-11-06Paper
Combinatorial Online Prediction via Metarounding2013-11-06Paper
Online Prediction under Submodular Constraints2012-10-16Paper
Energy and depth of threshold circuits2012-04-03Paper
Online Linear Optimization over Permutations2011-12-16Paper
Approximate Reduction from AUC Maximization to 1-Norm Soft Margin Optimization2011-10-19Paper
Lower Bounds for Linear Decision Trees via an Energy Complexity Argument2011-08-17Paper
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions2011-02-21Paper
Learnability of exclusive-or expansion based on monotone DNF formulas2010-04-27Paper
Energy Complexity and Depth of Threshold Circuits2009-10-20Paper
Size and Energy of Threshold Circuits Computing Mod Functions2009-10-16Paper
Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity2008-11-18Paper
Smooth Boosting for Margin-Based Ranking2008-10-14Paper
Editors’ Introduction2008-08-19Paper
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments2008-07-10Paper
Aggregating Strategy for Online Auctions2007-09-10Paper
Algorithmic Learning Theory2006-11-01Paper
Algorithmic Learning Theory2005-08-18Paper
10.1162/15324430414243282004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q30466962004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q30445122004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q30445152004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44732532004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44705782004-07-01Paper
Top-down decision tree learning as information based boosting2003-05-14Paper
Predicting nearly as well as the best pruning of a planar decision graph.2003-01-21Paper
Proper learning algorithm for functions of \(k\) terms under smooth distributions.2003-01-14Paper
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme2001-08-20Paper
The learnability of exclusive-or expansions based on monotone DNF formulas2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q49553232000-05-25Paper
https://portal.mardi4nfdi.de/entity/Q49378542000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q47034501999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q47038601999-12-01Paper
Learning orthogonal F-Horn formulas1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q31269301997-04-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Eiji Takimoto