DOI Technical Report DOI-Home Page
RIFIS Technical Report
Last modified: 06/11/15

DOI Technical Report


  1. Y. Kawahara, H. Furusawa and M. Mori, Categorical Representation Theorems of Fuzzy Relations, May 1996.
  2. D. Ikeda and H. Arimura, Elementary Formal Systems with the subword property characterize the class P, May 1996.
  3. K. Niijima, Learning of Associative Memory Networks Based Upon Cone-Like Domains of Attraction, June 1996.
  4. H. Sakamoto, The learnability of simple deterministic finite-memory automata, September 1996.
  5. T. Erlebach, P. Rossmanith, H. Stadtherr, A. Steger and T. Zeugmann, Efficient Learning of One-Variable Pattern Languages from Positive Data, December 1996.
  6. N. Furukawa, S. Matsumoto, A. Shinohara, T. Shoudai and S. Miyano, HAKKE: a multi-strategy prediction system for sequences, December 1996.
  7. M. Miyazaki, A. Shinohara and M. Takeda, An improved pattern matching algorithm for strings in terms of straight-line programs, January 1997.
  8. K. Niijima and K. Kuzume, Wavelets with orthogonality conditions of convolution type, January 1997.
  9. M. Mori and Y. Kawahara, Rewriting fuzzy graphs, February 1997.
  10. K.P. Jantke, R. Knauf and T. Abel, A TURING Test Scenario to Estimate an AI System's Validity, March 1997.
  11. D. Ikeda and H. Arimura, On the complexity of languages definable by hereditary elementary formal systems, March 1997.
  12. K.P. Jantke and V. Dötsch, Extended Experimental Explorations of the Necessity of User Guidance in Case-Based Learning, March 1997.
  13. J. Case, S. Jain, S. Lange and T. Zeugmann, Incremental Concept Learning for Bounded Data Mining, April 1997.
  14. E. Hirowatari and S. Arikawa, Inferability of Recursive Real-Valued Functions, April 1997.
  15. K. Niijima, H. Uchida, E. Hirowatari and S. Arikawa,Discovery of Differential Equations from Numerical Data , September 1997.
  16. Hitoshi Furusawa,A Representation Theorem for Relation Algebras: Concepts of Scalar Relations and Point Relations , September 1997.
  17. R\"udiger Reischuk and Thomas Zeugmann,Learning One-Variable Pattern Languages in Linear Average Time , September 30 1997.
  18. M.H.Mohamed, T.Minamoto and K.Niijima,Convergence Rate of Minimization Learning for Neural networks , October 1997.
  19. Masayuki Takeda,Pattern matching machine for text compressed using finite state model , October 1997.
  20. Y. Kawahara and H. Furusawa,Crispness nad Representation Theorem in Dedekind Categories , December 1997.
  21. H. Sakamoto and D. Ikeda,On the Complexity of Decision Problems for Finite-Memory Automata , January 1998.
  22. P. Rossmanith and T. Zeugmann,Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data , January 1998.
  23. S. INOKUCHI,On Behaviors of Cellular Automata with Rule 156 , March 1998.
  24. T.Minamoto, N.Yamamoto and M.T.Nakao,Numerical verification method for solutions of the perturbed Gelfand equation , March 1998.
  25. H. Arimura, A. Wataki, R. Fujino, S. Arikawa,A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases , March 1998.
  26. H. Sakamoto,Finding a one-variable pattern from incomplete data , May 1998.
  27. H. Sakamoto,Consistency problem for one-variable patterns is polynomially decidable , May 1998.
  28. S.Takano, T.Minamoto, K.Niijima,Moving Object Recognition Using Wavelets and Learning of Eigenspaces , June 1998.
  29. A.Ohkubo, M.H.Mohamed and K.Niijima,A Soil Moisture Map Generated from Satellite Data by Using Domains of Attraction in Neural Networks , July 1998.
  30. R. Reischuk and T. Zeugmann,Analyzing the Average-Case Behavior of Conjunctive Learning Algorithms , August 1998.
  31. Steffen Lange and Thomas Zeugmann (Eds.),Workshop on Applied Learning Theory, Kaiserslautern, Germany, Proceedings , October 1998.
  32. Yasuo Kawahara,Lattices in Dedekind Categories , January 1999.
  33. Takuya Kida, Masayuki Takeda, Ayumi Shinohara and Setsuo Arikawa,Shift-And Approach to Pattern Matching in LZW Compressed Text , January 1999.
  34. Y. Shibata, M. Takeda, A. Shinohara, S. Arikawa,Pattern Matching in Text Compressed by Using Antidictionaries , January 1999.
  35. S. Inokuchi and Y. Kawahara,Tree Expressions and Their Product Formula , February 1999.
  36. S. Inokuchi,On Behaviors of Cellular Automata with Rule 14 and 142 , February 1999.
  37. Teruya Minamoto,Numerical existence and uniqueness proof for solutions of nonlinear hyperbolic equations , April 1999.
  38. Y.Shibata, T.Kida, S.Fukamachi, M.Takeda, A.Shinohara, T.Shinohara, S.Arikawa,Byte pair encoding: a text compression scheme that accelerates pattern matching , April 1999.
  39. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, S. Arikawa,,A Unifying Framework for Compressed Pattern Matching , April 1999.
  40. Y. Kawahara and M. Mori,Hennessy-Milner Properties in Schr\"oder Categories , April 1999.
  41. S.Inokuchi and T.Sato,On Limit Cycles and Transient Lengths of Cellular Automata with Threshold Rules , July 1999.
  42. T.Minamoto, K.Niijima and S.Arikawa,Discovery of a system of differential equations from noisy numerical data , July 1999.
  43. F. Stephan and T. Zeugmann,Learning Classes of Approximations to Non-Recursive Functions , July 1999.
  44. Y. Kawahara and H. Ohkuma,Realtional Aspects of Relational Database Dependencies , August 1999.
  45. H. Hoshino, A. Shinohara, M. Takeda and S. Arikawa, Online construction of subsequence automata for multiple texts, January 2000.
  46. M. Hirao, A. Shinohara, M. Takeda and S. Arikawa, Faster fully compressed pattern matching algorithm for a subclass of straight-line programs, January 2000.
  47. Y. Shibata, T. Matsumoto, M. Takeda, A. Shinohara and S. Arikawa,A Boyer-Moore type algorithm for compressed pattern matching , January 2000.
  48. M. Takeda,T. Kida, Y. Shibata, T. Matsumoto, S. Fukamachi, A. Shinohara, T. Shinohara, and S. Arikawa,Practical Aspects of String Pattern Matchingin Compressed Texts , Jan 2000.
  49. K. Niijima, A. Ohkubo, and M.H. Mohamed ,Learning of Three-Layered Neural Networks by Enlarging Domains of Recognition , February 2000.
  50. H. Sakamoto, H. Arimura, and S. Arikawa ,Identification of Tree Translation Rules from Examples , April 2000.
  51. Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa ,Bit-parallel approach to approximate string matching in compressed texts , April 2000.
  52. M. Hirao, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa ,A Practical Algorithm to Find Best Subsequence Patterns , June 2000.
  53. Kensuke Baba, Yukiyoshi Kameyama, and Sachio Hirokawa, Combinatory Logic and lambda-Calculus for Classical Logic , August 2000.
  54. Kensuke Baba, Sachio Hirokawa, and Ken-etsu Fujita, Parallel Reduction in Type Free lambda-mu-Calculus , August 2000.
  55. Kensuke Baba, Sachio Hirokawa, Ryo Kashima, Yuichi Komori, Izumi Takeuti, Case Calculus for Classical Logic , August 2000.
  56. Hiroshi Sakamoto, Kouichi Hirata, and Hiroki Arimura, Learning Elementary Formal Systems with Queries , October 2000.
  57. Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa, Compressed Pattern Matching for Sequitur , November 2000.
  58. Hiroshi Sakamoto, Hiroki Arimura, and Setsuo Arikawa, Extracting Partial Structures from HTML Documents , November 2000.
  59. Kouichi Hirata, Hiroshi Sakamoto, and Hiroki Arimura, A Catalog for Prediction-Preserving Reducibility with Membership Queries on Formal Languages , November 2000.
  60. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa,On-line construction of compact directed acyclic word graphs , January 2001.
  61. Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa,Multiple Pattern Matching Algorithms on Collage System , January 2001.
  62. Toru Kasai, Hiroki Arimura, Setsuo Arikawa,Linear-time Substring Traversal with Suffix Arrays , February 2001.
  63. Koichi Niijima, Marghny H. Mohamed,Neural Networks as Domains of Classification , March 2001.
  64. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa,Construction of the CDAWG for a Trie , April 2001.
  65. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa,On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs , May 2001.
  66. Takashi Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, and Fumihiro Matsuo. ,Musical Sequence Comparison for Melodic and Rhythmic Similarities , May 2001.
  67. Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Sinichi Shimozono, and Setsuo Arikawa. ,Mining Semi-Structured Data by Path Expressions , May 2001.
  68. Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa,Efficient Learning of Semi-structured Data from Queries , May 2001.
  69. K. Yamamoto, M. Takeda, A. Shinohara, T. Fukuda, and I. Nanri,Discovering Repetitive Expressions and Affinities from Anthologies of classical Japanese Poems , May 2001.
  70. Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, and Ayumi Shinohara,Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works , May 2001.
  71. Hiroshi Sakamoto, Hiroki Arimura, and Setsuo Arikawa,Knowledge Discovery from Semistructured Texts , June 2001.
  72. Hiroshi Sakamoto, Shinichi Shimozono, Ayumi Shinohara, Masayuki Takeda, On the Minimization Problem of Text Compression Scheme by a Reduced Grammar Transfrom , August 2001.
  73. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa,Unification of Algorithms to Construct Index Structures for Texts , August 2001.
  74. Yasuo Kawahara,Groups in Allegories , August 2001.
  75. H. Okuma and Y. Kawahara,A Completeness Theorem for Extended Order Dependencies on Relational Attribute Models in Dedekind Categories , August 2001.
  76. Masao Mori,A Sufficient Condition for Secure Ping-Pong Protocols , September 2001.
  77. Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa,Efficient Substructure Discovery from Large Semi-structured Data , October 2001.
  78. Hiroshi Sakamoto, Shinichi Shimozono, Ayumi Shinohara, Masayuki Takeda, O(log n)-Approximation Algorithm for Grammar-Based Compression , January 2002.
  79. Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Setsu Arikawa, A Practical Algorithm to Find the Best Episode Patterns , June 2001.
  80. Shunsuke Inenaga, Bidirectional On-Lin Linear-Time Construction of Suffix Trees and Directed Acyclic Word Graphs , February 2002.
  81. Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, and Setsuo Arikawa, The Minimum DAWG for All Suffixes of a String and its Applications , February 2002.
  82. Hyen Yeal Lee and Yasuo Kawahara,Some Recursive Formulas for Transition Functions of Finite Cellular Automata , February 2002.
  83. Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, Setsuo Arikawa,Optimized Substructure Discovery for Semi-structured Data , March 2002.
  84. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa ,Space-Economical Construction of Index Structures for All Suffixes of a String , March 2002.
  85. Hitomi Okuma, Wendy MacCaull, and Yasuo Kawahara,Informational representability for contexts in Dedekind categories , May 2002.
  86. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa ,Compact Directed Acyclic Word Graphs for a Sliding Window , April 2002.
  87. Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa ,Discovering Best Variable-Length-Don't-Care Patterns , May 2002.
  88. Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, and Setsuo Arikawa,Online Algorithms for Mining Semi-structured Data Stream , June 2002.
  89. T. Abdukirim, K. Niijima and S. Takano,Lifting dyadic wavelets , October 2002.
  90. Yasuo Kawahara and Hitomi Okuma,Demonic orders and quasi-totality in Dedekind categories , November 2002.
  91. Hiroshi Sakamoto,A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression , January 2003.
  92. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda,Inferring Strings from Graphs , January 2003.
  93. Tatsuya Asai, Hiroki Arimura, Takeaki Uno, and Shin-ichi Nakano,Discovering Frequent Substructures in Large Unordered Trees , June 2003.
  94. Daisuke Ikeda,Instance Based Table Integration Algorithm for Multilingual Tables on the Web , June 2003.
  95. Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-ichi Nakano, and Ken Satoh,Efficient Tree Mining Using Reverse Search , June 2003.
  96. Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, and Setsuo Arikawa,Discovering Most Classificatory Patterns for Very Expressive Pattern Classes , June 2003.
  97. Daisuke Ikeda, Yasuhiro Yamada, and Sachio Hirokawa,A Template Discovery Algorithm by Substring Amplification , December 2003.
  98. Daisuke Ikeda and Yasuhiro Yamada,Information Extraction with and without Parsing Semi-structured Documents , March 2004.
  99. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, An efficient pattern matching algorithm for OBDD text compression , April 2004.
  100. Turghunjan Abdukirim, Koichi Niijima, and Shigeru Takano,Design of Biorthogonal Wavelet Filters by Gain Control , May 2004.
  101. Turghunjan Abdukirim and Koichi Niijima,A New Class of Biorthogonal Wavelet Filters Designed Using Dyadic Lifting Scheme , May 2004.
  102. Kohei Hatano, Smooth Boosting Using an Information-Based Criterion, May 2006.
  103. Masayuki Takeda, Akira Ishino, and Shuichi Mitarai, A Light-Weight XML Query Processor for a Large Number of Structural and Textual Patterns , July 2006.
  104. Shigeru Takano and Koichi Niijima, Robust Person Authentication Using Dyadic Wavelet Filters Learned by Cosine-maximization , December 2006.
  105. Yuka Higashijima, Shigeru Takano, and Koichi Niijima, Image Classification by Lifting Wavelet PCA , December 2006.
  106. Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda, Unsupervised Spam Detection based on String Alienness Measures , January 2007.
  107. Kensuke Baba, Hanmei E, and Yunqing Yu, A Parallel Computation for Shift-Add Algorithm , May 2007.


How to make DOI Technical Report cover page and LIST, see here [DOI inside only]
If you want to register your technical report, click here. [DOI inside only]
RIFIS Technical Report
DOI Home Page