The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Akira Maruoka: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kazuyuki Amano, Akira Maruoka
    On Learning Monotone Boolean Functions under the Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:57-68 [Conf]
  2. Shigeaki Harada, Eiji Takimoto, Akira Maruoka
    Online Allocation with Risk Information. [Citation Graph (0, 0)][DBLP]
    ALT, 2005, pp:343-355 [Conf]
  3. Akira Maruoka, Eiji Takimoto
    Structured Weight-Based Prediction Algorithms. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:127-142 [Conf]
  4. Akira Miyashiro, Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka
    Learning Orthogonal F-Horn Formulas. [Citation Graph (0, 0)][DBLP]
    ALT, 1995, pp:110-122 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:385-400 [Conf]
  6. Eiji Takimoto, Syuhei Koya, Akira Maruoka
    Boosting Based on Divide and Merge. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:127-141 [Conf]
  7. Eiji Takimoto, Akira Maruoka
    On the Sample Complexity of Consistent Learning with One-Sided Error. [Citation Graph (0, 0)][DBLP]
    ALT, 1993, pp:265-278 [Conf]
  8. Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka
    Learnability of Exclusive-Or Expansion Based on Monotone DNF Formulas. [Citation Graph (0, 0)][DBLP]
    ALT, 1996, pp:12-25 [Conf]
  9. Eiji Takimoto, Ichiro Tajika, Akira Maruoka
    Mutual Information Gaining Algorithm and Its Relation to PAC-Learning Algorithm. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:547-559 [Conf]
  10. Yoshifumi Sakai, Akira Maruoka
    Learning k-Term Monotone Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    ALT, 1992, pp:197-207 [Conf]
  11. Kazuyuki Amano, Akira Maruoka
    Some Properties of MODm Circuits Computing Simple Functions. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:227-237 [Conf]
  12. Kazuyuki Amano, Akira Maruoka, Jun Tarui
    On the Negation-Limited Circuit Complexity of Merging. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:204-209 [Conf]
  13. Shigeaki Harada, Eiji Takimoto, Akira Maruoka
    Aggregating Strategy for Online Auctions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:33-41 [Conf]
  14. Takayuki Sato, Kazuyuki Amano, Akira Maruoka
    On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:104-115 [Conf]
  15. Yoshifumi Sakai, Akira Maruoka
    Learning Monotone Log-Term DNF Formulas. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:165-172 [Conf]
  16. Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka
    Proper Learning Algorithm for Functions of k Terms Under Smooth Distributions. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:206-213 [Conf]
  17. Eiji Takimoto, Akira Maruoka
    Conservativeness and Monotonicity for Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:377-383 [Conf]
  18. Jun Mizuno, Tasuya Watanabe, Kazuya Ueki, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka
    On-Line Estimation of Hidden Markov Model Parameters. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2000, pp:155-169 [Conf]
  19. Eiji Takimoto, Akira Maruoka
    On the Boosting Algorithm for Multiclass Functions Based on Information-Theoretic Criterion for Approxiamtion. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1998, pp:256-267 [Conf]
  20. Akira Maruoka, Eiji Takimoto
    On-Line Algorithm to Predict Nearly as Well as the Best Pruning of a Decision Tree. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:296-306 [Conf]
  21. Eiji Takimoto, Akira Maruoka
    Top-Down Decision Tree Boosting and Its Applications. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:327-337 [Conf]
  22. Kazuyuki Amano, Akira Maruoka
    Potential of the Approximation Method (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:431-440 [Conf]
  23. Kazuyuki Amano, Akira Maruoka
    On the Monotone Circuit Complexity of Quadratic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:28-40 [Conf]
  24. Shuji Jimbo, Akira Maruoka
    Selection Networks with 8n log2n Size and O(log n) Depth. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:165-174 [Conf]
  25. Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka
    The Computational Power of a Family of Decision Forests. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:123-134 [Conf]
  26. Kazuyuki Amano, Akira Maruoka
    On Optimal Merging Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:152-161 [Conf]
  27. Kazuyuki Amano, Akira Maruoka
    On the Complexity of Depth-2 Circuits with Threshold Gates. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:107-118 [Conf]
  28. Kazuyuki Amano, Akira Maruoka
    A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:399-408 [Conf]
  29. Shuji Jimbo, Akira Maruoka
    Expanders Obtained from Affine Transformations (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:88-97 [Conf]
  30. Kazuyuki Amano, Akira Maruoka
    The Monotone Circuit Complexity of Quadratic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:3-14 [Journal]
  31. Shuji Jimbo, Akira Maruoka
    Expanders obtained from affine transformations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:4, pp:343-355 [Journal]
  32. Akira Maruoka, Mike Paterson, Hirotaka Koizumi
    Consistency of Natural Relations on Sets. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:3, pp:281-293 [Journal]
  33. Kazuyuki Amano, Akira Maruoka, Jun Tarui
    On the negation-limited circuit complexity of merging. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:1, pp:3-8 [Journal]
  34. Kazuyuki Amano, Akira Maruoka
    Better upper bounds on the QOBDD size of integer multiplication. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1224-1232 [Journal]
  35. Kazuyuki Amano, Akira Maruoka
    Better Simulation of Exponential Threshold Weights by Polynomial Weights [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:090, pp:- [Journal]
  36. Akira Maruoka, Masayuki Kimura
    Condition for Injectivity of Global Maps for Tessellation Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1976, v:32, n:2, pp:158-162 [Journal]
  37. Akira Maruoka, Masayuki Kimura
    Decomposition Phenomenon in One-Dimensional Scope-Three Tessellation Automata with Arbitrary Number of States [Citation Graph (0, 0)][DBLP]
    Information and Control, 1977, v:34, n:4, pp:296-313 [Journal]
  38. Akira Maruoka, Masayuki Kimura
    Completeness Problem of Multidimensional Tessellation Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1977, v:35, n:1, pp:52-86 [Journal]
  39. Katsutoshi Nakayama, Akira Maruoka
    Loop Circuits and Their Relation to Razborov's Approximation Model [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:119, n:2, pp:154-159 [Journal]
  40. Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka
    Proper Learning Algorithm for Functions of k Terms under Smooth Distributions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:152, n:2, pp:188-204 [Journal]
  41. Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura
    Inclusion-exclusion for k-CNF formulas. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:111-117 [Journal]
  42. Shuji Jimbo, Akira Maruoka
    On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:5, pp:277-282 [Journal]
  43. Shuji Jimbo, Akira Maruoka
    On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:1, pp:17-23 [Journal]
  44. Akira Maruoka, Masayuki Kimura
    Completeness Problem of One-Dimensional Binary Scope-3 Tessellation Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:9, n:1, pp:31-47 [Journal]
  45. Akira Maruoka, Masayuki Kimura
    Injectivity and Surjectivity of Parallel Maps for Cellular Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:18, n:1, pp:47-64 [Journal]
  46. Kazuyuki Amano, Akira Maruoka
    Approximation Algorithms for DNF Under Distributions with Limited Independence. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:2, pp:181-196 [Journal]
  47. Yoshifumi Sakai, Akira Maruoka
    Learning Monotone Log-Term DNF Formulas under the Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:1, pp:17-33 [Journal]
  48. Kazuyuki Amano, Akira Maruoka
    The Potential of the Approximation Method. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:433-447 [Journal]
  49. Kazuyuki Amano, Akira Maruoka
    A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:201-216 [Journal]
  50. Qian-Ping Gu, Akira Maruoka
    Amplification of Bounded Depth Monotone Read-Once Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:41-55 [Journal]
  51. Qian-Ping Gu, Akira Maruoka
    Learning Monotone Boolean Functions by Uniformly Distributed Examples. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:587-599 [Journal]
  52. Shuji Jimbo, Akira Maruoka
    A Method of Constructing Selection Networks with O(log n) Depth. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:4, pp:709-739 [Journal]
  53. Akira Maruoka
    Complexity Based on Partitioning of Boolean Circuits and Their Relation to Multivalued Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1986, v:35, n:2, pp:115-123 [Journal]
  54. Akira Maruoka, Namio Honda
    The Range of Logical Flexibility of Tree Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1975, v:24, n:1, pp:9-28 [Journal]
  55. Kazuyuki Amano, Akira Maruoka
    On learning monotone Boolean functions under the uniform distribution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:1, pp:3-12 [Journal]
  56. Akira Maruoka
    Open Maps for Tessellation Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:217-224 [Journal]
  57. Akira Maruoka, Masayuki Kimura
    Strong Surjectivity is Equivalent to C-Injectivity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:269-277 [Journal]
  58. Akira Maruoka, Masayuki Kimura, Nobuyoshi Shoji
    Pattern Decomposition for Tessellation Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:211-226 [Journal]
  59. Eiji Takimoto, Akira Maruoka
    Top-down decision tree learning as information based boosting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:2, pp:447-464 [Journal]
  60. Eiji Takimoto, Akira Miyashiro, Akira Maruoka, Yoshifumi Sakai
    Learning Orthogonal F-Horn Formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:185, n:1, pp:177-190 [Journal]
  61. Eiji Takimoto, Akira Maruoka, Volodya Vovk
    Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:1, pp:179-209 [Journal]
  62. Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka
    The learnability of exclusive-or expansions based on monotone DNF formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:241, n:1-2, pp:37-50 [Journal]

  63. Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.460secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002