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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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 apparent in case of an estimation on a moving window. 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. (en)
Title	Algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension Algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension (en)
skos:prefLabel	Algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension Algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension (en)
skos:notation	RIV/67985556:_____/10:00346967!RIV11-MSM-67985556
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1M0572), P(GA102/08/0567), Z(AV0Z10750506)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Šindelář, Jan
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav teorie informace a automatizace AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	245924
http://linked.open...ai/riv/idVysledku	RIV/67985556:_____/10:00346967
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	regression; Bayesian; complex splitting algorithm; robust (en)
http://linked.open.../riv/klicoveSlovo	robust regression Bayesian complex splitting algorithm
http://linked.open...ontrolniKodProRIV	[24DE519EF446]
http://linked.open...v/mistoKonaniAkce	Veszprém
http://linked.open...i/riv/mistoVydani	Veszprém
http://linked.open...i/riv/nazevZdroje	Proceedings of the 11th International PhD Workshop on Systems and Control a Young Generation Viewpoint
http://linked.open...in/vavai/riv/obor	BB
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Data, algorithms, decision making Fully probabilistic design of dynamic decision strategies
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Šindelář, Jan
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2010-09-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Pokročilé matematické metody získávání, zpracování a využití informací a znalostí ve složitých a nedeterministických systémech
number of pages	6 (xsd:int)
http://purl.org/ne...btex#hasPublisher	University of Pannonia
https://schema.org/isbn	978-615-5044-00-7

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software