An average-compress algorithm for the sample mean problem under dynamic time warping
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource, 1 online resource.
- Language
-
Englisch
- Bibliographic citation
-
An average-compress algorithm for the sample mean problem under dynamic time warping ; volume:86 ; number:4 ; day:3 ; month:6 ; year:2023 ; pages:885-903 ; date:8.2023
Journal of global optimization ; 86, Heft 4 (3.6.2023), 885-903, 8.2023
- Creator
-
Jain, Brijnesh
Froese, Vincent
Schultz, David
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10898-023-01294-9
- URN
-
urn:nbn:de:101:1-2023101110181659054571
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:57 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Jain, Brijnesh
- Froese, Vincent
- Schultz, David
- SpringerLink (Online service)
Other Objects (12)
Warping
ERP latency contrasts using Dynamic Time Warping algorithm
On rates of convergence for sample average approximations in the almost sure sense and in mean
On rates of convergence for sample average approximations in the almost sure sense and in mean
Mean-semivariance portfolio optimization using minimum average partial
Twadn: an efficient alignment algorithm based on time warping for pairwise dynamic networks
Clustering of sample average approximation for stochastic program
Optimierung des Reflective-Warping-Verfahrens
Stochastic Nash Equilibrium Problems: Sample Average Approximation and Applications
The Sample Average Approximation Method for Stochastic Discrete Optimization
DYNAMIC TIME WARPING FOR CROPS MAPPING
IMAGE STITCHING WITH PERSPECTIVE-PRESERVING WARPING
Warping
ERP latency contrasts using Dynamic Time Warping algorithm
On rates of convergence for sample average approximations in the almost sure sense and in mean
On rates of convergence for sample average approximations in the almost sure sense and in mean
Mean-semivariance portfolio optimization using minimum average partial
Twadn: an efficient alignment algorithm based on time warping for pairwise dynamic networks
Clustering of sample average approximation for stochastic program
Optimierung des Reflective-Warping-Verfahrens
Stochastic Nash Equilibrium Problems: Sample Average Approximation and Applications
The Sample Average Approximation Method for Stochastic Discrete Optimization
DYNAMIC TIME WARPING FOR CROPS MAPPING
IMAGE STITCHING WITH PERSPECTIVE-PRESERVING WARPING
Warping
ERP latency contrasts using Dynamic Time Warping algorithm
On rates of convergence for sample average approximations in the almost sure sense and in mean
On rates of convergence for sample average approximations in the almost sure sense and in mean
Mean-semivariance portfolio optimization using minimum average partial
Twadn: an efficient alignment algorithm based on time warping for pairwise dynamic networks
Clustering of sample average approximation for stochastic program
Optimierung des Reflective-Warping-Verfahrens
Stochastic Nash Equilibrium Problems: Sample Average Approximation and Applications
The Sample Average Approximation Method for Stochastic Discrete Optimization
DYNAMIC TIME WARPING FOR CROPS MAPPING