Akira Maruoka

Publication Activity (10 Years)

Years Active: 1973-2020
Publications (10 Years): 3

Top Topics

Lifelong Learning

Image Filtering

Learning Process

Top Venues

J. Exp. Theor. Artif. Intell.

Publications

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