( en | de | ru )

 

Disambiguation of "Asai, Tatsuya"

Author of the publication

copydeleteadd this publication to your clipboard
EVIS: A Fast and Scalable Episode Matching Engine for Massively Parallel Data Streams.

, , , , and . DASFAA (2), volume 7239 of Lecture Notes in Computer Science, page 213-223. Springer, (2012)

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.

Kwaichiro Asai

Tatsuya Nakada

Yusuke Asai

Tatsuya Hagino

Tatsuya Banno

 

Other publications of authors with the same name

Training Parse Trees for Efficient VF Coding., , , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 179-184. Springer, (2010)A Fast Algorithm for Matching Planar Maps with Minimum Fréchet Distances., , , and . BigSpatial@SIGSPATIAL, page 25-34. ACM, (2015)Optimized Substructure Discovery for Semi-structured Data., , , , and . PKDD, volume 2431 of Lecture Notes in Computer Science, page 1-14. Springer, (2002)Efficient Substructure Discovery from Large Semi-Structured Data., , , , , and . IEICE Trans. Inf. Syst., 87-D (12): 2754-2763 (2004)Discovery of Areas with Locally Maximal Confidence from Location Data., , , , and . DASFAA (1), volume 8421 of Lecture Notes in Computer Science, page 47-61. Springer, (2014)Incorporating AI Methods in Micro-dynamic Analysis to Support Group-Specific Policy-Making., , , , , and . PRIMA, volume 13753 of Lecture Notes in Computer Science, page 122-138. Springer, (2022)An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting., , and . PAKDD Workshops, volume 5433 of Lecture Notes in Computer Science, page 13-25. Springer, (2008)Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams., , , , and . JSAI Workshops, volume 3609 of Lecture Notes in Computer Science, page 29-45. Springer, (2004)Discovering Frequent Substructures in Large Unordered Trees., , , and . Discovery Science, volume 2843 of Lecture Notes in Computer Science, page 47-61. Springer, (2003)Improving Parse Trees for Efficient Variable-to-Fixed Length Codes., , , , and . J. Inf. Process., 20 (1): 238-249 (2012)