PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Takeda, Masayuki"

Author of the publication

copydeleteadd this publication to your clipboard
Adaptive Online Prediction Using Weighted Windows.

, , , and . IEICE Transactions, 94-D (10): 1917-1923 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Takeda, Masayuki
add a person with the name Takeda, Masayuki
 

Other publications of authors with the same name

From Run Length Encoding to LZ78 and Back Again., , , , and . DCC, page 143-152. IEEE, (2013)Multiple Pattern Matching in LZW Compressed Text., , , , and . Data Compression Conference, page 103-112. IEEE Computer Society, (1998)Computing Smallest and Largest Repetition Factorizations in O(n log n) Time., , , , , and . Stringology, page 135-145. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)Discovering instances of poetic allusion from anthologies of classical Japanese poems., , , , and . Theor. Comput. Sci., 292 (2): 497-524 (2003)Compressed Pattern Matching.. Encyclopedia of Algorithms, Springer, (2008)Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings., , , , and . ISAAC, volume 92 of LIPIcs, page 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Uniform Characterizations of Polynomial-Query Learnabilities., , , and . Discovery Science, volume 1532 of Lecture Notes in Computer Science, page 84-92. Springer, (1998)On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations., , , , and . CPM, volume 128 of LIPIcs, page 29:1-29:11. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)Faster STR-IC-LCS Computation via RLE., , , , and . CPM, volume 78 of LIPIcs, page 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Speeding Up q-Gram Mining on Grammar-Based Compressed Texts., , , and . CPM, volume 7354 of Lecture Notes in Computer Science, page 220-231. Springer, (2012)