Eiji Takimoto

Orcid: 0000-0001-9542-2553

According to our database1, Eiji Takimoto authored at least 97 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Rotation-Invariant Convolution Networks with Hexagon-Based Kernels.
IEICE Trans. Inf. Syst., 2024

Solving Linear Regression with Insensitive Loss by Boosting.
IEICE Trans. Inf. Syst., 2024

Online Job Scheduling with <i>K</i> Servers.
IEICE Trans. Inf. Syst., 2024

A CQI and Hysteretic-Based Decision Algorithm to Prevent Handover Failures for Pedestrian Mobility in Mobile Communication HetNet.
IEEE Access, 2024

Opportunistic Downlink User Connectivity in NOMA Enhanced NB-IoT Systems, A Semi-Matching Approach.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2024

2023
An Improved Metarounding Algorithm via Frank-Wolfe.
CoRR, 2023

Pure exploration in multi-armed bandits with low rank structure using oblivious sampler.
CoRR, 2023

Load Balancing Multi-Player MAB Approaches for RIS-Aided mmWave User Association.
IEEE Access, 2023

On Enhancing WiGig Communications With A UAV-Mounted RIS System: A Contextual Multi-Armed Bandit Approach.
Proceedings of the 34th IEEE Annual International Symposium on Personal, 2023

Advanced Learning Schemes for Metaverse Applications in B5G/6G Networks.
Proceedings of the IEEE International Conference on Metaverse Computing, 2023

A Dual-Objective Bandit-Based Opportunistic Band Selection Strategy for Hybrid-Band V2X Metaverse Content Update.
Proceedings of the IEEE Global Communications Conference, 2023

Boosting-Based Construction of BDDs for Linear Threshold Functions and Its Application to Verification of Neural Networks.
Proceedings of the Discovery Science - 26th International Conference, 2023

Extended Formulations via Decision Diagrams.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
Value-utilized taint propagation: toward precise detection of apps' information flows across Android API calls.
Int. J. Inf. Sec., 2022

Firewall Traversal Method by Pseudo-TCP Encapsulation.
IEICE Trans. Inf. Syst., 2022

Boosting as Frank-Wolfe.
CoRR, 2022

Simplified and unified analysis of various learning problems by reduction to Multiple-Instance Learning.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

2021
Performance Evaluation of Heterogeneous Cellular Networks Using Stochastic Petri Nets.
Proceedings of the International Conference on Software, 2021

Improved Algorithms for Online Load Balancing.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

WiGig Wireless Sensor Selection Using Sophisticated Multi Armed Bandit Schemes.
Proceedings of the Thirteenth International Conference on Mobile Computing and Ubiquitous Network, 2021

An online semi-definite programming with a generalised log-determinant regularizer and its applications.
Proceedings of the Asian Conference on Machine Learning, 2021

Expert advice problem with noisy low rank loss.
Proceedings of the Asian Conference on Machine Learning, 2021

VTDroid: Value-based Tracking for Overcoming Anti-Taint-Analysis Techniques in Android Apps.
Proceedings of the ARES 2021: The 16th International Conference on Availability, 2021

2020
Boosting over non-deterministic ZDDs.
Theor. Comput. Sci., 2020

Theory and Algorithms for Shapelet-Based Multiple-Instance Learning.
Neural Comput., 2020

Neighbor Discovery and Selection in Millimeter Wave D2D Networks Using Stochastic MAB.
IEEE Commun. Lett., 2020

A generalised log-determinant regularizer for online semi-definite programming and its applications.
CoRR, 2020

Minimax Optimal Stochastic Strategy (MOSS) For Neighbor Discovery and Selection In Millimeter Wave D2D Networks.
Proceedings of the 23rd International Symposium on Wireless Personal Multimedia Communications, 2020

2019
Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Recognition of Japanese Historical Hand-Written Characters Based on Object Detection Methods.
Proceedings of the 5th International Workshop on Historical Document Imaging and Processing, 2019

Prevention of Data Leakage due to Implicit Information Flows in Android Applications.
Proceedings of the 14th Asia Joint Conference on Information Security, 2019

2018
Efficient Reformulation of 1-Norm Ranking SVM.
IEICE Trans. Inf. Syst., 2018

Tighter Generalization Bounds for Matrix Completion Via Factorization Into Constrained Matrices.
IEICE Trans. Inf. Syst., 2018

Online Linear Optimization with the Log-Determinant Regularizer.
IEICE Trans. Inf. Syst., 2018

Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Multiple-Instance Learning by Boosting Infinitely Many Shapelet-based Classifiers.
CoRR, 2018

Decision Diagrams for Solving a Job Scheduling Problem Under Precedence Constraints.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

User-Side Updating of Third-Party Libraries for Android Applications.
Proceedings of the Sixth International Symposium on Computing and Networking, 2018

2017
Boosting the kernelized shapelets: Theory and algorithms for local features.
CoRR, 2017

2016
Bandit online optimization over the permutahedron.
Theor. Comput. Sci., 2016

A Combinatorial Metrical Task System Problem Under the Uniform Metric.
Proceedings of the Algorithmic Learning Theory - 27th International Conference, 2016

2015
Lower Bounds for Linear Decision Trees with Bounded Weights.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Online Density Estimation of Bradley-Terry Models.
Proceedings of The 28th Conference on Learning Theory, 2015

Minimax Fixed-Design Linear Regression.
Proceedings of The 28th Conference on Learning Theory, 2015

Online Linear Optimization for Job Scheduling Under Precedence Constraints.
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

2014
Efficient Sampling Method for Monte Carlo Tree Search Problem.
IEICE Trans. Inf. Syst., 2014

Online matrix prediction for sparse loss matrices.
Proceedings of the Sixth Asian Conference on Machine Learning, 2014

2013
Efficient Algorithms for Combinatorial Online Prediction.
Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

Combinatorial Online Prediction via Metarounding.
Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

2012
Online Rank Aggregation.
Proceedings of the 4th Asian Conference on Machine Learning, 2012

Online Prediction under Submodular Constraints.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions.
Theor. Comput. Sci., 2011

Adaptive Online Prediction Using Weighted Windows.
IEICE Trans. Inf. Syst., 2011

Lower Bounds for Linear Decision Trees via an Energy Complexity Argument.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Online Linear Optimization over Permutations.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Approximate Reduction from AUC Maximization to 1-Norm Soft Margin Optimization.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
Energy and depth of threshold circuits.
Theor. Comput. Sci., 2010

NPN-Representatives of a Set of Optimal Boolean Formulas.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators.
IEICE Trans. Inf. Syst., 2010

2009
Size and Energy of Threshold Circuits Computing Mod Functions.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Energy Complexity and Depth of Threshold Circuits.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Linear Programming Boosting by Column and Row Generation.
Proceedings of the Discovery Science, 12th International Conference, 2009

Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes.
Proceedings of the Theory of Computing 2009, 2009

2008
Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity.
Theor. Comput. Sci., 2008

Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Smooth Boosting for Margin-Based Ranking.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

Evaluation of Multi-Channel Flooding for Inter-Vehicle Communication.
Proceedings of the 22nd International Conference on Advanced Information Networking and Applications, 2008

2007
An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity.
Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

Editors' Introduction.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006
Foreword.
Theor. Comput. Sci., 2006

Online Allocation with Risk Information.
IEICE Trans. Inf. Syst., 2006

Aggregating Strategy for Online Auctions.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2004
Relationships between Horn Formulas and XOR-MDNF Formulas.
IEICE Trans. Inf. Syst., 2004

Boosting Based on Divide and Merge.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
Top-down decision tree learning as information based boosting.
Theor. Comput. Sci., 2003

Path Kernels and Multiplicative Updates.
J. Mach. Learn. Res., 2003

2002
Predicting nearly as well as the best pruning of a planar decision graph.
Theor. Comput. Sci., 2002

Top-Down Decision Tree Boosting and Its Applications.
Proceedings of the Progress in Discovery Science, 2002

On-Line Algorithm to Predict Nearly as Well as the Best Pruning of a Decision Tree.
Proceedings of the Progress in Discovery Science, 2002

2001
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme.
Theor. Comput. Sci., 2001

2000
The learnability of exclusive-or expansions based on monotone DNF formulas.
Theor. Comput. Sci., 2000

On-Line Estimation of Hidden Markov Model Parameters.
Proceedings of the Discovery Science, 2000

The Minimax Strategy for Gaussian Density Estimation. pp.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

The Last-Step Minimax Algorithm.
Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1999
Proper Learning Algorithm for Functions of k Terms under Smooth Distributions.
Inf. Comput., 1999

1998
On the Boosting Algorithm for Multiclass Functions Based on Information-Theoretic Criterion for Approxiamtion.
Proceedings of the Discovery Science, 1998

Structured Weight-Based Prediction Algorithms.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
Learning Orthogonal F-Horn Formulas.
Theor. Comput. Sci., 1997

A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
Learnability of Exclusive-Or Expansion Based on Monotone DNF Formulas.
Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995
On the Sample Complexity of Consistent Learning with One-Sided Error.
IEICE Trans. Inf. Syst., 1995

Proper Learning Algorithm for Functions of <i>k</i> Terms Under Smooth Distributions.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Learning Orthogonal <i>F</i>-Horn Formulas.
Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994
Mutual Information Gaining Algorithm and Its Relation to PAC-Learning Algorithm.
Proceedings of the Algorithmic Learning Theory, 1994

1993
Relationships between learning and information compression based on PAC learning model.
Syst. Comput. Jpn., 1993

Conservativeness and Monotonicity for Learning Algorithms.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1991
Relationships between PAC-learning algorithms and weak Occam algorithms.
Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991


  Loading...