Algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension
1.
SYSNO ASEP
0346967
Druh ASEP
C - Konferenční příspěvek (mezinárodní konf.)
Zařazení RIV
D - Článek ve sborníku
Název
Algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension
Tvůrce(i)
Šindelář, Jan (UTIA-B)
Zdroj.dok.
Proceedings of the 11th International PhD Workshop on Systems and Control a Young Generation Viewpoint. - Veszprém : University of Pannonia, 2010
- ISBN 978-615-5044-00-7
Rozsah stran
s. 62-67
Poč.str.
6 s.
Akce
11th International PhD Workshop on Systems and Control a Young Generation Viewpoint
1M0572 GA MŠMT - Ministerstvo školství, mládeže a tělovýchovy
GA102/08/0567 GA ČR - Grantová agentura ČR
CEZ
AV0Z10750506 - UTIA-B (2005-2011)
Anotace
In the article algorithm for splitting and merging complexes of convex polyhedra is proposed. The need for such an algorithm emerges for example in computation of normalization factor of Bayesian estimated posterior likelihood of parameters in an auto-regression model with Laplace distributed innovations, where the split of the complex corresponds to newly arrived data incorporation and the merging relates to making such a model adaptive by forgetting older data values -- the situation is most apparent in case of an estimation on a moving window.