Zobrazeno 1 - 2
of 2
pro vyhledávání: '"estimate under time constraint"'
Publikováno v:
Statistiques [stat]. Université de Lille 1-Sciences et Technologies, 2018. Français. ⟨NNT : ⟩
In the current context, we need to develop algorithms which are able to treat voluminous data with a short computation time. For instance, the dynamic programming applied to the change-point detection problem in the distribution can not treat quickly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::05c709a0e7e5be42fa10b992056ddcf0
https://inria.hal.science/tel-01657546
https://inria.hal.science/tel-01657546
Publikováno v:
Statistiques [stat]. Université de Lille 1-Sciences et Technologies, 2018. Français. ⟨NNT : ⟩
In the current context, we need to develop algorithms which are able to treat voluminous data with a short computation time. For instance, the dynamic programming applied to the change-point detection problem in the distribution can not treat quickly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4254::05c709a0e7e5be42fa10b992056ddcf0
https://inria.hal.science/tel-01657546
https://inria.hal.science/tel-01657546