s路平行有限时间吉布斯分类

Proceedings of the IEEE 27th Annual Northeast Bioengineering Conference (Cat. No.01CH37201) Pub Date : 2001-03-31 DOI:10.1109/NEBC.2001.924726

I. Greenshields, Zhihong Yang

{"title":"s路平行有限时间吉布斯分类","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":"{\"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}","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

摘要

吉布斯分类通常是相对于Metropolis方案进行退火。当计算周期的数量有界时，Azencott证明了并行退火是一种可行的方法。在这里，我们描述了一个具有后退火合并策略的s路有限时间调度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

s-way parallel finite time Gibbs classification

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the IEEE 27th Annual Northeast Bioengineering Conference (Cat. No.01CH37201)

自引率

0.00%

发文量