Nederlands
Contact
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||
|
|
Evers, S.
(2008)
Exploiting sparsity and sharing in probabilistic sensor data models.
Technical Report TR-CTIT-08-68,
Centre for Telematics and Information Technology University of Twente, Enschede.
ISSN 1381-3625
Full text available as:
 AbstractProbabilistic sensor models defined as dynamic Bayesian networks can possess an inherent sparsity that is not reflected in the structure of the network. Classical inference algorithms like variable elimination and junction tree propagation cannot exploit this sparsity. Also, they do not exploit the opportunities for sharing calculations among different time slices of the model. We show that, using a relational representation, inference expressions for these sensor models can be rewritten to make efficient use of sparsity and sharing.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||
