DocumentCode
3237132
Title
Associative Matrix Complexity Levels
Author
Cherkaskyy, M.V. ; Abdallah, Said Sadek
fYear
2005
fDate
5-7 Sept. 2005
Firstpage
208
Lastpage
210
Abstract
The aim of the article is demonstration the advantages of pseudo SH-model´s complexity characteristics in evaluating matrix constructions. Matrix devices on each level are shown by algorithm´s pseudo SH-models.
Keywords
computational complexity; matrix algebra; associative matrix complexity levels; pseudo SH-model; structural complexity; Associative memory; Complexity theory; Conferences; Data acquisition; Hardware; Information analysis; Productivity; Signal synthesis; Vents; Writing; Complexity characteristics; Hardware and structural complexity; associative matrix; complexity levels; time;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2005. IDAACS 2005. IEEE
Conference_Location
Sofia
Print_ISBN
0-7803-9445-3
Electronic_ISBN
0-7803-9446-1
Type
conf
DOI
10.1109/IDAACS.2005.282971
Filename
4062122
Link To Document