We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
A spline-based modification of the previously developed Neuro-Fuzzy Kolmogorov's Network (NFKN) is proposed. In order to improve the approximation accuracy, cubic B-splines ar...
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...
We present a novel approach for the direct computation of integral surfaces in general vector fields. As opposed to previous work, which we analyze in detail, our approach is based...
Christoph Garth, Hari Krishnan, Xavier Tricoche,...
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...