Akira Maruoka

82 papers A* 5B 22C 3Misc 4Journal 45Unranked 3
YearRankTypeTitle / Venue / Authors
2020 J jnl
Analyzing trajectories of learning processes through behaviour-based entropy.
J. Exp. Theor. Artif. Intell.
Shinsuke Seino, Kenji Kimura, Satoshi Kawamura, Yoshifumi Sasaki, Akira Maruoka
2019 C conf
Halide and GENESIS for Generating Domain-Specific Architecture of Guided Image Filtering.
ISCAS
Akari Ishikawa, Norishige Fukushima, Akira Maruoka, Takuro Iizuka
2019 B conf
The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver.
WALCOM
Shuji Jimbo, Akira Maruoka
2013 C conf
A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem.
FedCSIS
Kazuya Haraguchi, Masaki Ishigaki, Akira Maruoka
2012 J jnl
How to Produce BlockSum Instances with Various Levels of Difficulty.
Inf. Media Technol.
Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka
2012 J jnl
How to Produce BlockSum Instances with Various Levels of Difficulty.
J. Inf. Process.
Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka
2008 Misc conf
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments.
COCOON
Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka
2007 J jnl
Better upper bounds on the QOBDD size of integer multiplication.
Discret. Appl. Math.
Kazuyuki Amano, Akira Maruoka
2006 Misc conf
Aggregating Strategy for Online Auctions.
COCOON
Shigeaki Harada, Eiji Takimoto, Akira Maruoka
2006 J jnl
On learning monotone Boolean functions under the uniform distribution.
Theor. Comput. Sci.
Kazuyuki Amano, Akira Maruoka
2006 Misc conf
On the Negation-Limited Circuit Complexity of Sorting and Inverting
COCOON
Takayuki Sato, Kazuyuki Amano, Akira Maruoka
2006 J jnl
Online Allocation with Risk Information.
IEICE Trans. Inf. Syst.
Shigeaki Harada, Eiji Takimoto, Akira Maruoka
2006 J jnl
The Monotone Circuit Complexity of Quadratic Boolean Functions.
Algorithmica
Kazuyuki Amano, Akira Maruoka
2005 J jnl
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log
SIAM J. Comput.
Kazuyuki Amano, Akira Maruoka
2005 B conf
On the Complexity of Depth-2 Circuits with Threshold Gates.
MFCS
Kazuyuki Amano, Akira Maruoka
2005 B conf
Online Allocation with Risk Information.
ALT
Shigeaki Harada, Eiji Takimoto, Akira Maruoka
2004 B ed.
Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004, Proceedings
ALT
Shai Ben-David, John Case, Akira Maruoka
2004 J jnl
Better Simulation of Exponential Threshold Weights by Polynomial Weights
Electron. Colloquium Comput. Complex.
Kazuyuki Amano, Akira Maruoka
2004 B conf
Boosting Based on Divide and Merge.
ALT
Eiji Takimoto, Syuhei Koya, Akira Maruoka
2004 B conf
On the Monotone Circuit Complexity of Quadratic Boolean Functions.
ISAAC
Kazuyuki Amano, Akira Maruoka
2004 J jnl
Relationships between Horn Formulas and XOR-MDNF Formulas.
IEICE Trans. Inf. Syst.
Kenshi Matsuo, Tetsuya Koyama, Eiji Takimoto, Akira Maruoka
2004 J jnl
The Potential of the Approximation Method.
SIAM J. Comput.
Kazuyuki Amano, Akira Maruoka
2003 J jnl
Inclusion-exclusion for k-CNF formulas.
Inf. Process. Lett.
Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura
2003 B conf
On Optimal Merging Networks.
MFCS
Kazuyuki Amano, Akira Maruoka
2003 J jnl
On the negation-limited circuit complexity of merging.
Discret. Appl. Math.
Kazuyuki Amano, Akira Maruoka, Jun Tarui
2003 C conf
Some Properties of MOD
CIAC
Kazuyuki Amano, Akira Maruoka
2003 J jnl
Top-down decision tree learning as information based boosting.
Theor. Comput. Sci.
Eiji Takimoto, Akira Maruoka
2002 B conf
On Learning Monotone Boolean Functions under the Uniform Distribution.
ALT
Kazuyuki Amano, Akira Maruoka
2002 — conf
On-Line Algorithm to Predict Nearly as Well as the Best Pruning of a Decision Tree.
Progress in Discovery Science
Akira Maruoka, Eiji Takimoto
2002 — conf
Top-Down Decision Tree Boosting and Its Applications.
Progress in Discovery Science
Eiji Takimoto, Akira Maruoka
2001 J jnl
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme.
Theor. Comput. Sci.
Eiji Takimoto, Akira Maruoka, Volodya Vovk
2001 B conf
The Computational Power of a Family of Decision Forests.
MFCS
Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka
2000 J jnl
Learning Monotone Log-Term DNF Formulas under the Uniform Distribution.
Theory Comput. Syst.
Yoshifumi Sakai, Akira Maruoka
2000 B conf
On-Line Estimation of Hidden Markov Model Parameters.
Discovery Science
Jun Mizuno, Tasuya Watanabe, Kazuya Ueki, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka
2000 J jnl
The learnability of exclusive-or expansions based on monotone DNF formulas.
Theor. Comput. Sci.
Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka
1999 Misc conf
On the Negation-Limited Circuit Complexity of Merging.
COCOON
Kazuyuki Amano, Akira Maruoka, Jun Tarui
1999 J jnl
Proper Learning Algorithm for Functions of k Terms under Smooth Distributions.
Inf. Comput.
Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka
1998 B conf
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log
MFCS
Kazuyuki Amano, Akira Maruoka
1998 J jnl
Consistency of Natural Relations on Sets.
Comb. Probab. Comput.
Akira Maruoka, Mike Paterson, Hirotaka Koizumi
1998 B conf
On the Boosting Algorithm for Multiclass Functions Based on Information-Theoretic Criterion for Approxiamtion.
Discovery Science
Eiji Takimoto, Akira Maruoka
1998 B conf
Structured Weight-Based Prediction Algorithms.
ALT
Akira Maruoka, Eiji Takimoto
1997 B conf
A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree.
ALT
Eiji Takimoto, Ken'ichi Hirai, Akira Maruoka
1997 B ed.
Algorithmic Learning Theory, 8th International Conference, ALT '97, Sendai, Japan, October 6-8, 1997, Proceedings
ALT
Ming Li, Akira Maruoka
1997 J jnl
Approximation Algorithms for DNF Under Distributions with Limited Independence.
Theory Comput. Syst.
Kazuyuki Amano, Akira Maruoka
1997 J jnl
Learning Orthogonal F-Horn Formulas.
Theor. Comput. Sci.
Eiji Takimoto, Akira Miyashiro, Akira Maruoka, Yoshifumi Sakai
1996 J jnl
A Method of Constructing Selection Networks with O(log n) Depth.
SIAM J. Comput.
Shuji Jimbo, Akira Maruoka
1996 J jnl
Approximation of the size of the union.
Syst. Comput. Jpn.
Shuji Jimbo, Akira Maruoka
1996 B conf
Learnability of Exclusive-Or Expansion Based on Monotone DNF Formulas.
ALT
Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka
1996 A* conf
Potential of the Approximation Method (extended abstract).
FOCS
Kazuyuki Amano, Akira Maruoka
1995 B conf
Learning Orthogonal
ALT
Akira Miyashiro, Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka
1995 J jnl
Loop Circuits and Their Relation to Razborov's Approximation Model
Inf. Comput.
Katsutoshi Nakayama, Akira Maruoka
1995 J jnl
On the Sample Complexity of Consistent Learning with One-Sided Error.
IEICE Trans. Inf. Syst.
Eiji Takimoto, Akira Maruoka
1995 A* conf
Proper Learning Algorithm for Functions of
COLT
Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka
1994 J jnl
Construction of pseudorandom permutations.
Syst. Comput. Jpn.
Yasuhiro Ohnishi, Akira Maruoka
1994 A* conf
Learning Monotone Log-Term DNF Formulas.
COLT
Yoshifumi Sakai, Akira Maruoka
1994 — conf
Mutual Information Gaining Algorithm and Its Relation to PAC-Learning Algorithm.
AII/ALT
Eiji Takimoto, Ichiro Tajika, Akira Maruoka
1994 J jnl
On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph.
Inf. Process. Lett.
Shuji Jimbo, Akira Maruoka
1994 J jnl
On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables.
Inf. Process. Lett.
Shuji Jimbo, Akira Maruoka
1993 A* conf
Conservativeness and Monotonicity for Learning Algorithms.
COLT
Eiji Takimoto, Akira Maruoka
1993 B conf
On the Sample Complexity of Consistent Learning with One-Sided Error.
ALT
Eiji Takimoto, Akira Maruoka
1993 J jnl
Relationships between learning and information compression based on PAC learning model.
Syst. Comput. Jpn.
Eiji Takimoto, Akira Maruoka
1992 B conf
Learning
ALT
Yoshifumi Sakai, Akira Maruoka
1992 J jnl
Learning Monotone Boolean Functions by Uniformly Distributed Examples.
SIAM J. Comput.
Qian-Ping Gu, Akira Maruoka
1992 B conf
Selection Networks with 8
ISAAC
Shuji Jimbo, Akira Maruoka
1991 B ed.
Algorithmic Learning Theory, 2nd International Workshop, ALT '91, Tokyo, Japan, October 23-25, 1991, Proceedings
ALT
Setsuo Arikawa, Akira Maruoka, Taisuke Sato
1991 J jnl
Amplification of Bounded Depth Monotone Read-Once Boolean Formulae.
SIAM J. Comput.
Qian-Ping Gu, Akira Maruoka
1991 J jnl
Learning boolean functions.
Syst. Comput. Jpn.
Qian-Ping Gu, Akira Maruoka
1991 B conf
Relationships between PAC-learning algorithms and weak Occam algorithms.
ALT
Eiji Takimoto, Akira Maruoka
1987 J jnl
Expanders obtained from affine transformations.
Comb.
Shuji Jimbo, Akira Maruoka
1986 J jnl
Complexity Based on Partitioning of Boolean Circuits and Their Relation to Multivalued Circuits.
IEEE Trans. Computers
Akira Maruoka
1986 J jnl
Time and communication complexity in parallel computations.
Syst. Comput. Jpn.
Hiroshi Ishioka, Akira Maruoka, Masayuki Kimura
1985 A* conf
Expanders Obtained from Affine Transformations (Preliminary Version)
STOC
Shuji Jimbo, Akira Maruoka
1983 J jnl
Open Maps for Tessellation Automata.
Theor. Comput. Sci.
Akira Maruoka
1982 J jnl
Strong Surjectivity is Equivalent to C-Injectivity.
Theor. Comput. Sci.
Akira Maruoka, Masayuki Kimura
1981 J jnl
Pattern Decomposition for Tessellation Automata.
Theor. Comput. Sci.
Akira Maruoka, Masayuki Kimura, Nobuyoshi Shoji
1979 J jnl
Injectivity and Surjectivity of Parallel Maps for Cellular Automata.
J. Comput. Syst. Sci.
Akira Maruoka, Masayuki Kimura
1977 J jnl
Completeness Problem of Multidimensional Tessellation Automata
Inf. Control.
Akira Maruoka, Masayuki Kimura
1977 J jnl
Decomposition Phenomenon in One-Dimensional Scope-Three Tessellation Automata with Arbitrary Number of States
Inf. Control.
Akira Maruoka, Masayuki Kimura
1976 J jnl
Condition for Injectivity of Global Maps for Tessellation Automata
Inf. Control.
Akira Maruoka, Masayuki Kimura
1975 J jnl
The Range of Logical Flexibility of Tree Networks.
IEEE Trans. Computers
Akira Maruoka, Namio Honda
1974 J jnl
Completeness Problem of One-Dimensional Binary Scope-3 Tessellation Automata.
J. Comput. Syst. Sci.
Akira Maruoka, Masayuki Kimura
1973 J jnl
Logical Networks of Flexible Cells.
IEEE Trans. Computers
Akira Maruoka, Namio Honda