Sciweavers

1337 search results - page 6 / 268
» Fast computation of distance estimators
Sort
View
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
14 years 8 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
WIA
2000
Springer
13 years 11 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
Anne Bergeron, Sylvie Hamel
JMM2
2007
59views more  JMM2 2007»
13 years 7 months ago
Single-Ended Quality Measurement of Noise Suppressed Speech Based on Kullback-Leibler Distances
— In this paper, a single-ended quality measurement algorithm for noise suppressed speech is described. The proposed algorithm computes fast approximations of KullbackLeibler dis...
Tiago H. Falk, Hua Yuan, Wai-Yip Chan
IJAR
2010
106views more  IJAR 2010»
13 years 6 months ago
A minimum distance estimator in an imprecise probability model - Computational aspects and applications
The present article considers estimating a parameter θ in an imprecise probability model (Pθ)θ∈Θ which consists of coherent upper previsions Pθ . After the definition of a...
Robert Hable
SIAMCOMP
2010
77views more  SIAMCOMP 2010»
13 years 6 months ago
The Computational Hardness of Estimating Edit Distance
Alexandr Andoni, Robert Krauthgamer