1. CMU Intellectual Repository
  2. Academic Support Units
  3. Chiang Mai University Library
  4. CMUL: Journal Articles
Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/60296
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSirion Vittayakornen_US
dc.contributor.authorSanpawat Kantabutraen_US
dc.contributor.authorChularat Tanpraserten_US
dc.date.accessioned2018-09-10T03:40:41Z-
dc.date.available2018-09-10T03:40:41Z-
dc.date.issued2008-10-06en_US
dc.identifier.other2-s2.0-52949140540en_US
dc.identifier.other10.1109/ECTICON.2008.4600360en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52949140540&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/60296-
dc.description.abstractK -medians is a well-known clustering algorithm in data mining literature. This paper describes three decision problems related to k-medians. These problems are called MEDIANS REPLACEMENT IN k-MEDIANS, MEDIAN DETERMINATION, and TITERATIONS k-MEDIANS problems. We show that these problems are in NC, each has a (logn)O(1) parallel time algorithm on an EREW PRAM model using nO(1) processors, and the result in each case is the strongest possible.1 ©2008 IEEE.en_US
dc.subjectComputer Scienceen_US
dc.subjectEngineeringen_US
dc.titleThe parallel complexities of the K-medians related problemsen_US
dc.typeConference Proceedingen_US
article.title.sourcetitle5th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, ECTI-CON 2008en_US
article.volume1en_US
article.stream.affiliationsChiang Mai Universityen_US
article.stream.affiliationsThailand National Electronics and Computer Technology Centeren_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


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