4 papers
Space-Optimal Algorithms for Spanning Forests in Dynamic Streams at Every Confidence Level: With and Without Deletion Constraints
Zemin Chao, Jianhe Cen, Hengzhao Ma +1
We characterize the optimal space for one-pass spanning-forest computation in dynamic streams of -vertex simple graphs with failure probability at most . Nelson and Yu proved…
Conditional Indexing Lower Bounds and Normalization Boundaries for Elastic Subsequence Matching
Zemin Chao, Zitong Li, Xiangyu Gao +1
We study static indexes for exact subsequence matching over all equal-length windows of a time series. Under deterministic SETH, for every fixed and , we exclude…
CARE: A Cascaded Framework for Efficient and Reliable Time Series Anomaly Detection
Zemin Chao, Qianhui Xu, Jianhe Cen +3
While deep learning models have achieved state-of-the-art performance in time series anomaly detection, their complex architectures incur substantial inference overhead. Existing m…
A New Lower Bounding Paradigm and Tighter Lower Bounds for Elastic Similarity Measures
Zemin Chao, Boyu Xiao, Zitong Li +3
Elastic similarity measures are fundamental to time series similarity search because of their ability to handle temporal misalignments. These measures are inherently computationall…