Clustering using self organized map on rmesh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Clustering finds its applications in image processing, business, and bioinformatics. In this paper two Self Organized map algorithms on Reconfigurable mesh with buses will be presented. These algorithms use M×K PEs and M×N×K PEs. The former has time complexity of 0(logM)for process one pattern. The latter has time complexity of O(logMN) for processing N patterns.

Original languageEnglish
Title of host publication20th International Conference on Computers and Their Applications 2005, CATA 2005
Pages91-96
Number of pages6
StatePublished - 1 Dec 2005
Event20th International Conference on Computers and Their Applications 2005, CATA 2005 - New Orleans, LA, United States
Duration: 16 Mar 200518 Mar 2005

Publication series

Name20th International Conference on Computers and Their Applications 2005, CATA 2005

Other

Other20th International Conference on Computers and Their Applications 2005, CATA 2005
CountryUnited States
CityNew Orleans, LA
Period16/03/0518/03/05

Fingerprint Dive into the research topics of 'Clustering using self organized map on rmesh'. Together they form a unique fingerprint.

  • Cite this

    Jenq, J. (2005). Clustering using self organized map on rmesh. In 20th International Conference on Computers and Their Applications 2005, CATA 2005 (pp. 91-96). (20th International Conference on Computers and Their Applications 2005, CATA 2005).