Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJyothi, K-
dc.contributor.authorSahoo, A K-
dc.identifier.citationICCEETS-2012 International Conference on Computing, Electronics and Electrical Technologies, Noorul Islam Centre for Higher Education, Kumaracoil, 21st- 22nd, March 2012en
dc.descriptionCopyright belongs to proceeding publisheren
dc.description.abstractIn this paper, we review some of the computationally efficient adaptive distributed strategies developed using incremental partial update techniques. The schemes mentioned here solve the problem of linear estimation with less number of computations in a cooperative fashion. In a distributed network each node contains local computing equipment which estimates and shares them with other nodes. The resulting algorithms are less complex in computations and in communication because of Incremental partial update algorithms and each node communicate with immediate node only. Computational complexity analysis is evaluated and performance characteristics of each algorithm are given with computer simulations. Simulation results show that with a small degradation in performance, considerable amount of computational complexity is reduced.en
dc.format.extent207528 bytes-
dc.subjectDistributed strategiesen
dc.subjectIncremental partial updateen
dc.subjectsequential partial updateen
dc.subjectstochastic partial updateen
dc.subjectMaxpartial updateen
dc.subjectcomputational complexityen
dc.titleEfficient adaptive strategies over distributed Networksen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
conf_final.pdf202.66 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.