The trilemma among CO2 emissions, energy use, and economic growth in Russia

C Magazzino, M Mele, C Drago, S Kuşkaya, C Pozzi… - Scientific Reports, 2023 - nature.com
This paper examines the relationship among CO2 emissions, energy use, and GDP in
Russia using annual data ranging from 1990 to 2020. We first conduct time-series analyses …

Navigating the Soundscape of Deception: A Comprehensive Survey on Audio Deepfake Generation, Detection, and Future Horizons

TM Wani, SAA Qadri, FA Wani… - Foundations and Trends …, 2024 - nowpublishers.com
The rise of audio deepfakes presents a significant security threat that undermines trust in
digital communications and media. These synthetic audio technologies can convincingly …

Brain EEG time-series clustering using maximum-weight clique

C Dai, J Wu, D Pi, SI Becker, L Cui… - IEEE transactions on …, 2020 - ieeexplore.ieee.org
Brain electroencephalography (EEG), the complex, weak, multivariate, nonlinear, and
nonstationary time series, has been recently widely applied in neurocognitive disorder …

Locality-sensitive hashing of curves

A Driemel, F Silvestri - arXiv preprint arXiv:1703.04040, 2017 - arxiv.org
We study data structures for storing a set of polygonal curves in ${\rm R}^ d $ such that,
given a query curve, we can efficiently retrieve similar curves from the set, where similarity is …

Approximating (k, )-center clustering for curves

K Buchin, A Driemel, J Gudmundsson, M Horton… - Proceedings of the …, 2019 - SIAM
Abstract The Euclidean k-Center problem is a classical problem that has been extensively
studied in computer science. Given a set G of n points in Euclidean space, the problem is to …

klcluster: Center-based clustering of trajectories

K Buchin, A Driemel, N van de L'Isle… - Proceedings of the 27th …, 2019 - dl.acm.org
Center-based clustering, in particular k-means clustering, is frequently used for point data.
Its advantages include that the resulting clustering is often easy to interpret and that the …

Solving Fréchet distance problems by algebraic geometric methods

SW Cheng, H Huang - Proceedings of the 2024 Annual ACM-SIAM …, 2024 - SIAM
We study several polygonal curve problems under the Fréchet distance via algebraic
geometric methods. Let 𝕏 dm and 𝕏 dk be the spaces of all polygonal curves of m and k …

Tight bounds for approximate near neighbor searching for time series under the Fréchet distance

K Bringmann, A Driemel, A Nusser, I Psarros - … of the 2022 Annual ACM-SIAM …, 2022 - SIAM
We study the c-approximate near neighbor problem under the continuous Fréchet distance:
Given a set of n polygonal curves with m vertices, a radius δ> 0, and a parameter k≤ m, we …

Approximating (k,ℓ)-Median Clustering for Polygonal Curves

M Buchin, A Driemel, D Rohde - ACM Transactions on Algorithms, 2023 - dl.acm.org
In 2015, Driemel, Krivošija, and Sohler introduced the k, ℓ-median clustering problem for
polygonal curves under the Fréchet distance. Given a set of input curves, the problem asks …

SETH says: Weak Fréchet distance is faster, but only if it is continuous and in one dimension

K Buchin, T Ophelders, B Speckmann - … of the Thirtieth Annual ACM-SIAM …, 2019 - SIAM
We show by reduction from the Orthogonal Vectors problem that algorithms with strongly
subquadratic running time cannot approximate the Fréchet distance between curves better …