CS 7638 MIDTERM REVIEW FLASHCARDS 2025/26
QUESTIONS & ANSWERS RATED 100% CORRECT.
Time & Space Complexity for Histogram Filters Answer - Exponential - O(n^m),
where n is the resolution of our bins and m is our number of dimensions.
Bayes' Rule Answer - P(A|B)=P(B|A)P(A)/P(B)
Properties of Kalman Filters Answer - Continuous, Unimodal, Symmetric,
Approximate
Properties of Particle Filters Answer - Continuous, Multimodal, Approximate
Properties of Histogram Filters Answer - Discrete, Multimodal, Approximate
Time & Space Complexity of Particle Filters Answer - ??? - Can be exponential,
can be better in some applications.
Time & Space Complexity of Kalman Filters Answer - Quadratic - O(N^2)?
When do we use convolutions in the motion/measure cycle? Answer - Motion
QUESTIONS & ANSWERS RATED 100% CORRECT.
Time & Space Complexity for Histogram Filters Answer - Exponential - O(n^m),
where n is the resolution of our bins and m is our number of dimensions.
Bayes' Rule Answer - P(A|B)=P(B|A)P(A)/P(B)
Properties of Kalman Filters Answer - Continuous, Unimodal, Symmetric,
Approximate
Properties of Particle Filters Answer - Continuous, Multimodal, Approximate
Properties of Histogram Filters Answer - Discrete, Multimodal, Approximate
Time & Space Complexity of Particle Filters Answer - ??? - Can be exponential,
can be better in some applications.
Time & Space Complexity of Kalman Filters Answer - Quadratic - O(N^2)?
When do we use convolutions in the motion/measure cycle? Answer - Motion