: 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 ap...
In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protographbased...
David G. M. Mitchell, Ali Emre Pusane, Norbert Goe...
Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers re...
Muhammad Marwan Muhammad Fuad, Pierre-Francois Mar...
The Discretizable Molecular Distance Geometry Problem is a subset of instances of the distance geometry problem that can be solved by a combinatorial algorithm called "Branch-...
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...