{"title":"s-way parallel finite time Gibbs classification","authors":"I. Greenshields, Zhihong Yang","doi":"10.1109/NEBC.2001.924726","DOIUrl":null,"url":null,"abstract":"Gibbs classification is usually performed by annealing relative to the Metropolis scheme. When the number of compute cycles is bounded, Azencott demonstrated that parallel annealing is a viable approach. Here we describe an s-way finite time schedule with a post-annealing merge strategy.","PeriodicalId":269364,"journal":{"name":"Proceedings of the IEEE 27th Annual Northeast Bioengineering Conference (Cat. No.01CH37201)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the IEEE 27th Annual Northeast Bioengineering Conference (Cat. No.01CH37201)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NEBC.2001.924726","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Gibbs classification is usually performed by annealing relative to the Metropolis scheme. When the number of compute cycles is bounded, Azencott demonstrated that parallel annealing is a viable approach. Here we describe an s-way finite time schedule with a post-annealing merge strategy.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
