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 language | English |
|---|---|
| Title of host publication | 20th International Conference on Computers and Their Applications 2005, CATA 2005 |
| Pages | 91-96 |
| Number of pages | 6 |
| State | Published - 1 Dec 2005 |
| Event | 20th International Conference on Computers and Their Applications 2005, CATA 2005 - New Orleans, LA, United States Duration: 16 Mar 2005 → 18 Mar 2005 |
Publication series
| Name | 20th International Conference on Computers and Their Applications 2005, CATA 2005 |
|---|
Other
| Other | 20th International Conference on Computers and Their Applications 2005, CATA 2005 |
|---|---|
| Country | United States |
| City | New Orleans, LA |
| Period | 16/03/05 → 18/03/05 |
Fingerprint
Cite this
}
Clustering using self organized map on rmesh. / Jenq, John.
20th International Conference on Computers and Their Applications 2005, CATA 2005. 2005. p. 91-96 (20th International Conference on Computers and Their Applications 2005, CATA 2005).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Clustering using self organized map on rmesh
AU - Jenq, John
PY - 2005/12/1
Y1 - 2005/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84883425883&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84883425883
SN - 9781618395528
T3 - 20th International Conference on Computers and Their Applications 2005, CATA 2005
SP - 91
EP - 96
BT - 20th International Conference on Computers and Their Applications 2005, CATA 2005
ER -