Masahiro Hirao

According to our database, Masahiro Hirao authored at least 6 papers between 2000 and 2003.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2003

A practical algorithm to find the best subsequence patterns.

Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Theor. Comput. Sci., 2003

2002

Finding Best Patterns Practically.

Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga

Proceedings of the Progress in Discovery Science, 2002

2001

Musical Sequence Comparison for Melodic and Rhythmic Similarities.

T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo

Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

A Practical Algorithm to Find the Best Episode Patterns.

Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

Compressed Pattern Matching for SEQUITUR.

Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Proceedings of the Data Compression Conference, 2001

2000

Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.

Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000