块排序很难

Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02 Pub Date : 2002-08-07 DOI:10.1109/ISPAN.2002.1004305

W. Bein, L. Larmore, S. Latifi, I. H. Sudborough

{"title":"块排序很难","authors":"W. Bein, L. Larmore, S. Latifi, I. H. Sudborough","doi":"10.1109/ISPAN.2002.1004305","DOIUrl":null,"url":null,"abstract":"Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which work in practice. We show that optimizing block sorting is NP-hard. Along with this result, we give new non-trivial lower bounds. These bounds can be computed efficiently. We define the concept of local property algorithms and show that several previously published block sorting algorithms fall into this class.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Block sorting is hard\",\"authors\":\"W. Bein, L. Larmore, S. Latifi, I. H. Sudborough\",\"doi\":\"10.1109/ISPAN.2002.1004305\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which work in practice. We show that optimizing block sorting is NP-hard. Along with this result, we give new non-trivial lower bounds. These bounds can be computed efficiently. We define the concept of local property algorithms and show that several previously published block sorting algorithms fall into this class.\",\"PeriodicalId\":255069,\"journal\":{\"name\":\"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.2002.1004305\",\"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 International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2002.1004305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

摘要

块排序用于光学字符识别(OCR)。最近的工作重点是寻找在实践中有效的好策略。我们证明了优化块排序是np困难的。在此基础上，给出了新的非平凡下界。这些边界可以有效地计算出来。我们定义了局部属性算法的概念，并展示了几个先前发布的块排序算法属于这类。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Block sorting is hard

Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which work in practice. We show that optimizing block sorting is NP-hard. Along with this result, we give new non-trivial lower bounds. These bounds can be computed efficiently. We define the concept of local property algorithms and show that several previously published block sorting algorithms fall into this class.

求助全文

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

来源期刊

Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02

自引率

0.00%

发文量

期刊最新文献

Data structures for one-dimensional packet classification using most-specific-rule matching Optimal multicast tree routing for cluster computing in hypercube interconnection networks An overview of data replication on the Internet Fault-tolerant routing on the star graph with safety vectors Automatic processor lower bound formulas for array computations