Author of the publication

Distributed Algorithms to Find Similar Time Series.

, , , , , , , and . ECML/PKDD (3), volume 11908 of Lecture Notes in Computer Science, page 781-785. Springer, (2019)

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

Processing Top-k Queries in Distributed Hash Tables., , and . Euro-Par, volume 4641 of Lecture Notes in Computer Science, page 489-502. Springer, (2007)Spark-parSketch: A Massively Distributed Indexing of Time Series Datasets., , , , , and . CIKM, page 1951-1954. ACM, (2018)Querying Key-Value Stores Under Single-Key Constraints: Rewriting and Parallelization., , and . RuleML+RR, volume 11784 of Lecture Notes in Computer Science, page 198-206. Springer, (2019)Efficient Early Top-k Query Processing in Overloaded P2P Systems., , , and . DEXA (1), volume 6860 of Lecture Notes in Computer Science, page 140-155. Springer, (2011)Massively Distributed Environments and Closed Itemset Mining: The DCIM Approach., , , and . CAiSE, volume 10253 of Lecture Notes in Computer Science, page 231-246. Springer, (2017)Efficient Incremental Computation of Aggregations over Sliding Windows., , and . KDD, page 2136-2144. ACM, (2021)A Prime Number Based Approach for Closed Frequent Itemset Mining in Big Data., , , and . DEXA (1), volume 9261 of Lecture Notes in Computer Science, page 509-516. Springer, (2015)Efficient Evaluation of SUM Queries over Probabilistic Data., , and . IEEE Trans. Knowl. Data Eng., 25 (4): 764-775 (2013)Best position algorithms for efficient top-k query processing., , and . Inf. Syst., 36 (6): 973-989 (2011)Privacy-Preserving Top-k Query Processing in Distributed Systems., , and . Euro-Par, volume 11014 of Lecture Notes in Computer Science, page 281-292. Springer, (2018)