Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"Refactorization"”.
-
Multi-modal and inertial sensor solutions for navigation-type factor graphs
… (Junction) tree, which is an efficient symbolic refactorization of the nonparametric factor graph, and asymptotically approximates the underlying Chapman-Kolmogorov equations. Our method tracks dominant modes in the marginal posteriors of all variables with minimal approximation error, while …
-
Multi-modal and inertial sensor solutions for navigation-type factor graphs
… (Junction) tree, which is an efficient symbolic refactorization of the nonparametric factor graph, and approximates the underlying Chapman-Kolmogorov equations. Like the predecessor iSAM2 max-product algorithm [Kaess et al., IJRR 2012], we retain the Bayes tree incremental update property, which …
-
Απεικονίσεις Yang-Baxter, δομή Poisson και ολοκληρωσιμότητα
Σκοπός της παρούσας διατριβής είναι η κατασκευή και μελέτη συνολοθεωρητικών λύσεων της κβαντικής εξίσωσης Yang-Baxter (απεικονίσεις Yang-Baxter) και η συσχέτισή τους με την ολοκληρωσιμότητα διακριτών δυναμικών συστημάτων. Οι κατασκευές απεικονίσεων Yang-Baxter που προτείνονται προέρχονται από την …