Purchase Solution

Algorithm

Not what you're looking for?

Ask Custom Question

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.

Purchase this Solution
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...

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 ...

Purchase this Solution
Free BrainMass Quizzes
Javscript Basics

Quiz on basics of javascript programming language.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Basic Networking Questions

This quiz consists of some basic networking questions.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

View More Free Quizzes
Related BrainMass Solutions

  • Discrete Logarithms

    For coding part, I successfully coded shank's algorithm, Pollard's rho algorithm and Pohlig-Hellman algorithm. In my document and code, I not only gave the final solution for each problem, but also gave some intermediate results.

  • A basic overview of algorithm analysis

    284625 A basic overview of algorithm analysis An Algorithm is a set of steps that defines how a task must perform to produce expected results. An algorithm can be represented in many ways.

  • Election Algorithm

    540941 Election Algorithm Derive an election algorithm for bidirectional rings that is more efficient than the ring algorithm: The ring algorithm assumes that the links are unidirectional and that each process sends its message to the neighbor on the

  • Explanation of how to make an algorithm more efficient

    This solution takes an n-squared algorithm for finding the two closest elements in an array and shows how that algorithm can be converted to a much faster algorithm.

  • Algorithm Efficiency: Example Problems

    Consider the following algorithm where n is a positive integer. What is the efficiency class of this algorithm? Show your reasoning. Please see the attachment. Provides steps necessary to determine the algorithm efficiency problems.

  • Runtime Analysis of Search Algorithm

    Suppose an algorithm that processes a data set of size 8 has a runtime of 72, and the same algorithm on a data set of size 20 has a runtime of 420.

  • driving demand

    ultra-sensitive, job match algorithm.

  • Sub Algorithms Base Values

    Return str END Sub algorithm base values are examined. The expert declares the results.

  • Automata and Computability

    Consider an algorithm for SAT: "On input , try all possible assignments to the variables. Accept if any satisfy ." This algorithm clearly requires exponential time. Thus SAT has exponential time complexity.

  • Pseudocode for a Simple Task such as Turkey Sandwich.

    94377 Creating a Pseudocode Algorithm Create a pseudocode algorithm you would write for a simple task like making a turkey sandwich, as well as three simple control structures that could be used to create this algorithm.

View More Related Solutions