Explain the Canny's Algorithm.
No Answer is Posted For this Question
Be the First to Post Answer
Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.
What is breath-first search algorithm?
What is greedy best first search algorithm?
List the different algorithm techniques in machine learning?
Write the Shortest path algorithm for a graph.
Can you pick an algorithm. Write the psuedo-code for a parallel implementation?
Explain the concept behind dead lock avoidance, banker's algorithm.
0 Answers HPCL, Hughes Systique Corporation,
What are the disadvantages of breadth-first search algorithm?
Given a sorted array of n integers that has been rotated i(unknown) number of times, give a (log n) algorithm that finds an element in the array.
What do you mean by overfitting and underfitting algorithms?
How does deep learning contrast with other machine learning algorithms?
What was deep learning, & how does it contrast with other machine learning algorithms?
AI Algorithms (74)
AI Natural Language Processing (96)
AI Knowledge Representation Reasoning (12)
AI Robotics (183)
AI Computer Vision (13)
AI Neural Networks (66)
AI Fuzzy Logic (31)
AI Games (8)
AI Languages (141)
AI Tools (11)
AI Machine Learning (659)
Data Science (671)
Data Mining (120)
AI Deep Learning (111)
Generative AI (153)
AI Frameworks Libraries (197)
AI Ethics Safety (100)
AI Applications (427)
AI General (197)
AI AllOther (6)