Explore BrainMass
Share

Algorithm

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

Suppose we have a number of cabinets containing skeletons and bones. The size, shape, and bones connection are different.
The question is What are the structural relationships among these organisms?
Give any idea how algorithm should work?

This is not really a question. I just want some direction and ideas. I am okay even with wrong ideas.

© BrainMass Inc. brainmass.com October 25, 2018, 5:45 am ad1c9bdddf
https://brainmass.com/computer-science/algorithms/algorithm-433736

Solution Preview

If I have understood the question correctly, what you want to know is how your algorithm will be able to identify between different types of bones and skeletons regardless of where ever they may be.

For an algorithm to classify between different types of objects, it needs to rely on some statistic measures or features. These features defines the relationship among similar class group i.e. objects belonging to same category. In your case (skeletons and bones), the features could be the shape features, geometrical feature or texture based features.

The ...

Solution Summary

For an algorithm to classify between different types of objects, it needs to rely on some statistic measures or features. These features defines the relationship among similar class group i.e. objects belonging to same category. In your case (skeletons and bones), the features could be the shape features, geometrical feature or texture based features.

Kindly see detailed answer...

$2.19
See Also This Related BrainMass Solution

Prim Algorithm and Kruskal's Algorithm

Given the graph on the attachment, perform the following traversals in questions 1 and 2. Show the steps. Use extra space if needed.

1. Depth-First Search

2. Breadth-First Search

Give the weighted graph on the attachment; answer questions 3 - 4. Show the steps. Use extra space if needed.

3. Find the shortest paths from S to all the other nodes in the graph using Dijkstra Algorithm.

4. Find the Minimum-Cost Spanning Trees for the above graph using the following algorithms.
a. Prim Algorithm

b. Kruskal's Algorithm

View Full Posting Details