Author of the publication

Mining Frequent Diamond Episodes from Event Sequences.

, , and . MDAI, volume 4617 of Lecture Notes in Computer Science, page 477-488. Springer, (2007)

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.

 

Other publications of authors with the same name

Prediction-hardness of acyclic conjunctive queries.. Theor. Comput. Sci., 348 (1): 84-94 (2005)A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences., , and . PAKDD, volume 5476 of Lecture Notes in Computer Science, page 172-183. Springer, (2009)Heavy Caterpillar Distances for Rooted Labeled Unordered Trees., , and . ICPRAM, page 198-204. SCITEPRESS, (2020)Subcaterpillar Isomorphism Between Caterpillars: Subtree Isomorphism Restricted Text and Pattern Trees to Caterpillars., and . ICPRAM, page 89-94. SCITEPRESS, (2023)Caterpillar Inclusion: Inclusion Problem for Rooted Labeled Caterpillars., , and . ICPRAM, page 280-287. SCITEPRESS, (2022)Tractable and Intractable variations of Unordered Tree Edit Distance., , and . Int. J. Found. Comput. Sci., 25 (3): 307-330 (2014)A trim distance between positions as packaging signals in H3N2 influenza viruses., , , , and . SCIS&ISIS, page 1702-1707. IEEE, (2012)Fast Hilbert Sort Algorithm Without Using Hilbert Indices., , , and . SISAP, volume 9939 of Lecture Notes in Computer Science, page 259-267. (2016)A Simple Characterization on Serially Constructible Episodes., and . PAKDD, volume 5012 of Lecture Notes in Computer Science, page 600-607. Springer, (2008)An Isolated-Subtree Inclusion for Unordered Trees., , , and . IIAI-AAI, page 345-350. IEEE Computer Society, (2012)