Algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F10%3A00346967" target="_blank" >RIV/67985556:_____/10:00346967 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension
Original language description
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 apparentin case of an estimation on a moving window.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 11th International PhD Workshop on Systems and Control a Young Generation Viewpoint
ISBN
978-615-5044-00-7
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
University of Pannonia
Place of publication
Veszprém
Event location
Veszprém
Event date
Sep 1, 2010
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)