10608 search results - page 465 / 2122 » Complexity of O'Hara's Algorithm |
165
click to vote
CATA
2000
15 years 6 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
170
click to vote
ICDAR
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper presents an algorithm using adaptive local connectivity map for retrieving text lines from the complex handwritten documents such as handwritten historical manuscripts....
164
click to vote
WINE
2005
Springer
15 years 10 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
132
Voted
ASPDAC
2007
ACM
15 years 9 months ago
2007
ACM
- In general, fault dictionary is prevented from practical applications for its extremely large size. Several previous works are proposed for the fault dictionary size reduction. H...
141
Voted
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...