You are here:
Artificial Intelligence/A I
Advertisement
Question
A is a matrix of dimension mxn (both large numbers), containing many, many zeros.
Sketch a data structure which stores A using less space then a full matrix and program an access algorithm
to retrieve any a[i][j].
Hi dinesh,
these matrices are commonly known as sparse matrices. Access and storage algorithms for these objects are very well known and analysed. You can start with wikipedia:
http://en.wikipedia.org/wiki/Sparse_matrix
If you need more, just google it.
Best
G.
- Add to this Answer
- Ask a Question
| Rating(1-10) | Knowledgeability = 10 | Clarity of Response = 10 | Politeness = 10 |
| Comment | hi thanx a lot!!!!!!!!!!! | ||
Related Articles
Answers by Expert:
George Moustris
Expertise
I can answer most of the questions about the workings of a Fuzzy Logic machine, from the basics up to a certain advanced point.Questions regarding applications of Fuzzy systems intregrating with other technologies such as Neural Nets or Genetic Algorithms are propably out of my reach although,with some research,i could try to answer them(i have working knowledge of Neural Nets an Genetic Algorithms but i`m far from being consider an expert to these areas).
Experience
I have experience in Fuzzy Logic gained in projects i have been part of.The last project was a robotic vehicle that used a Fuzzy Logic path tracker which i designed.
Education/Credentials
Aristotle University of Thessaloniki,M.Eng. Electrical and Computer Engineering,
National Technical University of Athens,Phd, Computational Intelligence in Robotics
©2012 About.com, a part of The New York Times Company. All rights reserved.