In computer vision, what mathematical operation slides a small matrix (kernel/filter) over an image to perform element-wise multiplication and summation?
Image convolution slides a kernel matrix over pixel neighborhoods, computing dot-products to extract spatial features such as edges, blurs, and textures.
When multiple production rules have their conditions satisfied at the same time, what mechanism resolves the conflict?
A conflict resolution strategy (e.g., rule priority, specificity, recency) decides which rule fires from the active conflict set.
What are the Time Complexity and Space Complexity of the standard Minimax algorithm with maximum search depth m and legal branching factor b?
Minimax performs a full depth-first traversal of the game tree: it visits $O(b^m)$ nodes in time, while storing only the current path of O(b*m) states in memory.
Why is the K-Nearest Neighbors (KNN) algorithm formally classified as a 'Lazy Learner' (Instance-Based Learner)?
KNN is a lazy learner because training simply stores the instances. All computation—distance calculations and neighbor sorting—occurs when predicting new queries.
Which of the following stages are part of the multi-stage Canny Edge Detection algorithm?
John Canny's optimal edge detector uses five steps: Gaussian blur, gradient computation, non-maximum suppression, double thresholding, and hysteresis edge tracking. All options are correct.