相关论文: Binary Dynamic Time Warping in Linear Time
In artificial neural networks, weights are a static representation of synapses. However, synapses are not static, they have their own interacting dynamics over time. To instill weights with interacting dynamics, we use a model describing…
This short technical note presents a formal generalization of the Time Warp Edit Distance (TWED) proposed by Marteau (2009) to arbitrary metric spaces. By viewing both the observation and temporal domains as metric spaces $(X, d)$ and $(T,…
Compact white dwarf (WD) binaries are important sources for space-based gravitational-wave (GW) observatories, and an increasing number of them are being identified by surveys like ZTF. We study the effects of nonlinear dynamical tides in…
Dynamic Linear Models (DLMs) are commonly employed for time series analysis due to their versatile structure, simple recursive updating, ability to handle missing data, and probabilistic forecasting. However, the options for count time…
It is known that the digital waveguide (DW) method for solving the wave equation numerically on a grid can be manipulated into the form of the standard finite-difference time-domain (FDTD) method (also known as the ``leapfrog'' recursion).…
It has been alleged in several papers that the so called delayed continuous-time random walks (DCTRWs) provide a model for the one-dimensional telegraph equation at microscopic level. This conclusion, being widespread now, is strange, since…
Dynamic time warping constitutes a major tool for analyzing time series. In particular, computing a mean series of a given sample of series in dynamic time warping spaces (by minimizing the Fr\'echet function) is a challenging computational…
Dynamic Treatment Regimes (DTRs) provide a systematic framework for optimizing sequential decision-making in chronic disease management, where therapies must adapt to patients' evolving clinical profiles. Inverse probability weighting (IPW)…
Wide binaries made up of two white dwarfs (WDs) receive far less attention than their tight counterparts. However, our tests using the binary population synthesis code {\tt StarTrack} indicate that, for any set of reasonable initial…
The DTW Barycenter Averaging (DBA) algorithm is a widely used algorithm for estimating the mean of a given set of point sequences. In this context, the mean is defined as a point sequence that minimises the sum of dynamic time warping…
Time series similarity measures are highly relevant in a wide range of emerging applications including training machine learning models, classification, and predictive modeling. Standard similarity measures for time series most often…
For two d-dimensional point sets A, B of size up to n, the Chamfer distance from A to B is defined as CH(A,B) = \sum_{a \in A} \min_{b \in B} \|a-b\|. The Chamfer distance is a widely used measure for quantifying dissimilarity between sets…
Computing optimal transport (OT) distances such as the earth mover's distance is a fundamental problem in machine learning, statistics, and computer vision. In this paper, we study the problem of approximating the general OT distance…
Many stochastic time series can be modelled by discrete random walks in which a step of random sign but constant length $\delta x$ is performed after each time interval $\delta t$. In correlated discrete time random walks (CDTRWs), the…
A fundamental notion of distance between train and test distributions from the field of domain adaptation is discrepancy distance. While in general hard to compute, here we provide the first set of provably efficient algorithms for testing…
This technical report details a family of time warp distances on the set of discrete time series. This family is constructed as an editing distance whose elementary operations apply on linear segments. A specific parameter allows…
We have developed an optical simulator to test optical two-way time-frequency transfer (O-TWTFT) at the femtosecond level capable of simulating relative motion between two linked optical clock nodes up to Mach 1.8 with no moving parts. The…
Recently it was shown that the transitive closure of a directed graph can be updated using first-order formulas after insertions and deletions of single edges in the dynamic descriptive complexity framework by Dong, Su, and Topor, and…
A constant weight binary code consists of $n$-bit binary codewords, each with exactly $w$ bits equal to 1, such that any two codewords are at least Hamming distance $d$ apart. $A(n,d,w)$ is the maximum size of a constant weight binary code…
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is a stationary and ergodic process. In general, the stationary…