MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Ayumi Shinohara" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

63 documents found, showing 1 through 10. Next 10 →

ATOM

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
by Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
… , Ayumi Shinohara 2,3 , and Masayuki Takeda 2,4 1 Department of Computer Science, P.O. Box 68 (Gustaf…
Add To MetaCart

On the Minimization Problem of Text Compression Scheme by a Reduced Grammar Transform
by Hiroshi Sakamoto, Shinichi Shimozono, Ayumi Shinohara, Masayuki Takeda — 2002
… Shimozono z Ayumi Shinohara y Masayuki Takeda y Abstract The complexity of an optimization problem…
Add To MetaCart

O(log n)-Approximation Algorithm for Grammar-Based Compression
by Hiroshi Sakamoto, Shinichi Shimozono, Ayumi Shinohara, Masayuki Takeda
…) Hiroshi Sakamoto y , Shinichi Shimozono z , Ayumi Shinohara y , Masayuki Takeda y y Department…
Add To MetaCart

Compact directed acyclic word graphs for a sliding window
by Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa — 2002 — Proc. 9th International Symposium on String Processing and Information Retrieval (SPIRE’02), volume 2476 of Lecture Notes in Computer Science
… (JST) E-mail: s-ine@(email omitted); AYUMI SHINOHARA, Department of Informatics, Kyushu University 33…
Cited by 1 (0 self) – Add To MetaCart

Fully incremental LCS computation
by Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda — 2005 — In Proceedings of FCT
…Fully Incremental LCS Computation Yusuke Ishida 1 , Shunsuke Inenaga 1 , Ayumi Shinohara 2…
Cited by 1 (0 self) – Add To MetaCart

Linear-time off-line text compression by longest-first substitution
by Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara — 2003 — in Proc. 10th International Symp. on String Processing and Information Retrieval (SPIRE’03
… Funamoto 1 , Masayuki Takeda 1,2 , and Ayumi Shinohara 1,2 1 Department of Informatics, Kyushu University…
Cited by 3 (3 self) – Add To MetaCart

Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
by Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara — 2001 — In Proc. 12th Annual International Symposium on Algorithms and Computation (ISAAC’01
… Literary Works Hideaki Hori 1 , Shinichi Shimozono 2⋆ , Masayuki Takeda 3,4 , and Ayumi Shinohara 3 1…
Cited by 2 (1 self) – Add To MetaCart

Inferring strings from graphs and arrays
by Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda — In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), volume 2747 of LNCS
…Inferring Strings from Graphs and Arrays Hideo Bannai 1 , Shunsuke Inenaga 2 , Ayumi Shinohara 2…
Cited by 1 (0 self) – Add To MetaCart

Online Construction of Subsequence Automata for Multiple Texts
by Hiromasa Hoshino, Hiromasa Hoshino, Ayumi Shinohara, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Setsuo Arikawa — 2000
… by Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda and Setsuo Arikawa April, 2000 Department of Informatics…
Cited by 9 (2 self) – Add To MetaCart

On the Hardness of Approximating the Minimum Consistent OBDD Problem
by Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara — 1996
… Shimozono 2 Ayumi Shinohara 3 1 Department of Artificial Intelligence 2 Department of Control…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB