Srba (SLAM Algorithms SLAM Algorithms): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$? words? (Seems to store a constant number of O(n)*O(n)-sized matrices and O(n)*O(n)-sized tables (see section II, part C)) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2002 == Reference == http://ingmec.ual.es/~jlblanco/papers/blanco2013rba.pdf") |
No edit summary |
||
| Line 25: | Line 25: | ||
== Model of Computation == | == Model of Computation == | ||
Real RAM? | |||
== Year == | == Year == | ||
Latest revision as of 08:39, 10 April 2023
Time Complexity
$O(n^{2})$
Space Complexity
$O(n^{2})$? words?
(Seems to store a constant number of O(n)*O(n)-sized matrices and O(n)*O(n)-sized tables (see section II, part C))
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
No, deterministic
Model of Computation
Real RAM?
Year
2002