Eiji Takimoto

From MaRDI portal
(Redirected from Person:329615)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Extended formulations via decision diagrams2024-08-22Paper
Learning orthogonal F-Horn formulas
Lecture Notes in Computer Science
2023-12-08Paper
Improved algorithms for online load balancing2022-03-24Paper
Improved algorithms for online load balancing
(available as arXiv preprint)
2022-03-24Paper
Decision diagrams for solving a job scheduling problem under precedence constraints2020-12-16Paper
Theory and algorithms for shapelet-based multiple-instance learning
Neural Computation
2020-11-02Paper
Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints2020-02-25Paper
Boosting over non-deterministic ZDDs
Theoretical Computer Science
2020-01-16Paper
Boosting over non-deterministic ZDDs
WALCOM: Algorithms and Computation
2018-06-15Paper
Online Linear Optimization for Job Scheduling Under Precedence Constraints
Lecture Notes in Computer Science
2016-11-30Paper
A combinatorial metrical task system problem under the uniform metric
Lecture Notes in Computer Science
2016-11-09Paper
Bandit online optimization over the permutahedron
Theoretical Computer Science
2016-10-21Paper
Lower bounds for linear decision trees with bounded weights
Lecture Notes in Computer Science
2015-02-20Paper
Bandit online optimization over the permutahedron
Lecture Notes in Computer Science
2015-01-14Paper
Efficient algorithms for combinatorial online prediction
Lecture Notes in Computer Science
2013-11-06Paper
Combinatorial online prediction via metarounding
Lecture Notes in Computer Science
2013-11-06Paper
Online prediction under submodular constraints
Lecture Notes in Computer Science
2012-10-16Paper
Energy and depth of threshold circuits
Theoretical Computer Science
2012-04-03Paper
Online linear optimization over permutations
Algorithms and Computation
2011-12-16Paper
Approximate reduction from AUC maximization to 1-norm soft margin optimization
Lecture Notes in Computer Science
2011-10-19Paper
Lower bounds for linear decision trees via an energy complexity argument
Mathematical Foundations of Computer Science 2011
2011-08-17Paper
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
Theoretical Computer Science
2011-02-21Paper
Learnability of exclusive-or expansion based on monotone DNF formulas
Lecture Notes in Computer Science
2010-04-27Paper
Energy Complexity and Depth of Threshold Circuits
Fundamentals of Computation Theory
2009-10-20Paper
Size and Energy of Threshold Circuits Computing Mod Functions
Mathematical Foundations of Computer Science 2009
2009-10-16Paper
Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
Theoretical Computer Science
2008-11-18Paper
Smooth Boosting for Margin-Based Ranking
Lecture Notes in Computer Science
2008-10-14Paper
Editors’ Introduction
Lecture Notes in Computer Science
2008-08-19Paper
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments
Lecture Notes in Computer Science
2008-07-10Paper
Aggregating Strategy for Online Auctions
Lecture Notes in Computer Science
2007-09-10Paper
Algorithmic Learning Theory
Lecture Notes in Computer Science
2006-11-01Paper
Algorithmic Learning Theory
Lecture Notes in Computer Science
2005-08-18Paper
10.1162/1532443041424328
CrossRef Listing of Deleted DOIs
2004-10-28Paper
scientific article; zbMATH DE number 2089355 (Why is no real title available?)2004-08-12Paper
scientific article; zbMATH DE number 2086341 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 2086338 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 2080456 (Why is no real title available?)2004-08-04Paper
scientific article; zbMATH DE number 2077184 (Why is no real title available?)2004-07-01Paper
Top-down decision tree learning as information based boosting
Theoretical Computer Science
2003-05-14Paper
Predicting nearly as well as the best pruning of a planar decision graph.
Theoretical Computer Science
2003-01-21Paper
Proper learning algorithm for functions of \(k\) terms under smooth distributions.
Information and Computation
2003-01-14Paper
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
Theoretical Computer Science
2001-08-20Paper
The learnability of exclusive-or expansions based on monotone DNF formulas
Theoretical Computer Science
2000-08-21Paper
scientific article; zbMATH DE number 1453050 (Why is no real title available?)2000-05-25Paper
scientific article; zbMATH DE number 1404236 (Why is no real title available?)2000-02-20Paper
scientific article; zbMATH DE number 1379115 (Why is no real title available?)1999-12-15Paper
scientific article; zbMATH DE number 1372658 (Why is no real title available?)1999-12-01Paper
Learning orthogonal F-Horn formulas
Theoretical Computer Science
1998-07-22Paper
scientific article; zbMATH DE number 996386 (Why is no real title available?)1997-04-03Paper


Research outcomes over time


This page was built for person: Eiji Takimoto