The following pages link to Eiji Takimoto (Q329615):
Displayed 48 items.
- (Q198427) (redirect page) (← links)
- Bandit online optimization over the permutahedron (Q329616) (← links)
- Energy and depth of threshold circuits (Q410715) (← links)
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (Q627177) (← links)
- Improved algorithms for online load balancing (Q831807) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- Learning orthogonal F-Horn formulas (Q1390949) (← links)
- The learnability of exclusive-or expansions based on monotone DNF formulas (Q1575458) (← links)
- Predicting nearly as well as the best pruning of a planar decision graph. (Q1853514) (← links)
- Proper learning algorithm for functions of \(k\) terms under smooth distributions. (Q1854298) (← links)
- Top-down decision tree learning as information based boosting (Q1870539) (← links)
- Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints (Q2301756) (← links)
- A Combinatorial Metrical Task System Problem Under the Uniform Metric (Q2831385) (← links)
- Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
- Efficient Algorithms for Combinatorial Online Prediction (Q2859204) (← links)
- Combinatorial Online Prediction via Metarounding (Q2859207) (← links)
- Bandit Online Optimization over the Permutahedron (Q2938734) (← links)
- (Q3044512) (← links)
- (Q3044515) (← links)
- (Q3046696) (← links)
- Lower Bounds for Linear Decision Trees via an Energy Complexity Argument (Q3088072) (← links)
- Approximate Reduction from AUC Maximization to 1-Norm Soft Margin Optimization (Q3093962) (← links)
- Online Linear Optimization over Permutations (Q3104653) (← links)
- (Q3126930) (← links)
- Online Prediction under Submodular Constraints (Q3164825) (← links)
- Size and Energy of Threshold Circuits Computing Mod Functions (Q3182969) (← links)
- Energy Complexity and Depth of Threshold Circuits (Q3183623) (← links)
- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments (Q3511328) (← links)
- Smooth Boosting for Margin-Based Ranking (Q3529924) (← links)
- Learnability of exclusive-or expansion based on monotone DNF formulas (Q3556976) (← links)
- Aggregating Strategy for Online Auctions (Q3591296) (← links)
- (Q4470578) (← links)
- (Q4473253) (← links)
- (Q4703450) (← links)
- (Q4703860) (← links)
- 10.1162/1532443041424328 (Q4823522) (← links)
- (Q4937854) (← links)
- (Q4955323) (← links)
- Theory and Algorithms for Shapelet-Based Multiple-Instance Learning (Q5131159) (← links)
- Decision diagrams for solving a job scheduling problem under precedence constraints (Q5140712) (← links)
- Lower Bounds for Linear Decision Trees with Bounded Weights (Q5175129) (← links)
- Algorithmic Learning Theory (Q5395049) (← links)
- Algorithmic Learning Theory (Q5464489) (← links)
- Editors’ Introduction (Q5900218) (← links)
- Boosting over non-deterministic ZDDs (Q5915642) (← links)
- Boosting over non-deterministic ZDDs (Q5919322) (← links)
- Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme (Q5941373) (← links)
- Learning orthogonal F-Horn formulas (Q6061889) (← links)