Search Results1-20 of  36

  • 1 / 2
  • HATANO KOHEI ID: 9000018481548

    Articles in CiNii:1

    • Online Prediction over Permutahedron (2011)
  • HATANO KOHEI ID: 9000308048416

    Department of Informatics, Kyushu University (2014 from CiNii)

    Articles in CiNii:1

    • Online scheduling of precedence-constrained jobs on a single machine (2014)
  • HATANO KOHEI ID: 9000308048531

    Department of Informatics, Kyushu University (2014 from CiNii)

    Articles in CiNii:1

    • Online scheduling of precedence-constrained jobs on a single machine (2014)
  • HATANO Kohei ID: 9000004433412

    Articles in CiNii:31

    • The 21st Annual Conference on Learning Theory (COLT 2008) 参加報告 (2008)
    • Practical Algorithms for Pattern Based Linear Regression (テーマ:特集「シンボルグラウンディング問題」および一般) (2005)
    • Smooth Boosting with An Information-theoretic Criterion (テーマ:特集「シンボルグラウンディング問題」および一般) (2005)
  • HATANO Kohei ID: 9000019056252

    Department of Informatics, Kyushu University (2011 from CiNii)

    Articles in CiNii:1

    • Adaptive Online Prediction Using Weighted Windows (2011)
  • HATANO Kohei ID: 9000019096536

    Department of Informatics, Kyushu University (2011 from CiNii)

    Articles in CiNii:1

    • Approximate Reduction from AUC Maximization to 1-norm Soft Margin Optimization (2011)
  • HATANO Kohei ID: 9000107318931

    Department of Informatics, Kyushu University (2011 from CiNii)

    Articles in CiNii:1

    • Approximate Reduction from AUC Maximization to 1-norm Soft Margin Optimization (2011)
  • HATANO Kohei ID: 9000107323000

    Department of Informatics, Kyushu University (2008 from CiNii)

    Articles in CiNii:1

    • A Context Tree Weighting Algorithm with an Adaptive Window (2008)
  • HATANO Kohei ID: 9000243893438

    Department of Informatics, Kyushu University (2014 from CiNii)

    Articles in CiNii:1

    • Efficient Sampling Method for Monte Carlo Tree Search Problem (2014)
  • HATANO Kohei ID: 9000383088050

    AIP, RIKEN|Faculty of Arts and Science, Kyushu University (2018 from CiNii)

    Articles in CiNii:1

    • Efficient Reformulation of 1-Norm Ranking SVM (2018)
  • HATANO Kohei ID: 9000396103802

    Department of Informatics, Kyushu University|RIKEN AIP (2018 from CiNii)

    Articles in CiNii:1

    • Online Linear Optimization with the Log-Determinant Regularizer (2018)
  • HATANO Kohei ID: 9000397687881

    Department of Informatics, Kyushu University (2018 from CiNii)

    Articles in CiNii:1

    • Tighter Generalization Bounds for Matrix Completion Via Factorization Into Constrained Matrices (2018)
  • HATANO Kohei ID: 9000398137821

    Faculty of Arts and Science, Kyushu University|RIKEN AIP (2018 from CiNii)

    Articles in CiNii:1

    • Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem (2018)
  • HATANO Kohei ID: 9000406388185

    Kyushu University (2020 from CiNii)

    Articles in CiNii:1

    • FOREWORD (2020)
  • HATANO Kohei ID: 9000409167491

    Mitsubishi Heavy Industries, Ltd. (2019 from CiNii)

    Articles in CiNii:1

    • Non-destructive estimation of inelastic strains for turbine blades using whole contour change and a limited number of displacements (2019)
  • Hatano Kohei ID: 9000017194808

    Department of Informatics, Kyushu University (2006 from CiNii)

    Articles in CiNii:1

    • F_046 Boosting Using Classifiers with Nearly One-Sided Error (2006)
  • Hatano Kohei ID: 9000021655056

    Graduate School of Information Science and Electrical Engineering, Kyushu University (2009 from CiNii)

    Articles in CiNii:1

    • Thinning-out: A Method to Reduce Trials in Skill Discovery of a Robot (2009)
  • Hatano Kohei ID: 9000303992340

    Articles in CiNii:1

    • A Simple Boosting Algorithm Using Multi-Way Branching Decision Trees (2004)
  • Hatano Kohei ID: 9000402285512

    Articles in CiNii:1

    • Boosting over non-deterministic ZDDs (2018)
  • Hatano Kohei ID: 9000403556870

    Articles in CiNii:1

    • Smooth Boosting Using an Information-Based Criterion (2006)
  • 1 / 2
Page Top