Title :
Block sorting is hard
Author :
Bein, Wolfgang W. ; Larmore, Lawrence L. ; Latifi, Sara ; Sudborough, I. Hal
Author_Institution :
Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA
fDate :
6/24/1905 12:00:00 AM
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
Keywords :
computability; directed graphs; optical character recognition; optimisation; sorting; NP-hard; OCR; block sorting optimization; directed graph; local property algorithms; lower bounds; optical character recognition; Approximation algorithms; Character recognition; Computer science; Optical character recognition software; Parallel architectures; Performance evaluation; Sorting; Testing;
Conference_Titel :
Parallel Architectures, Algorithms and Networks, 2002. I-SPAN '02. Proceedings. International Symposium on
Conference_Location :
Makati City, Metro Manila
Print_ISBN :
0-7695-1579-7
DOI :
10.1109/ISPAN.2002.1004305
