10988 search results - page 60 / 2198 » Algorithmic Folding Complexity |
153
click to vote
ICDAR
2009
IEEE
16 years 23 days ago
2009
IEEE
We have proposed a complete system for text detection and localization in gray scale scene images. A boosting framework integrating feature and weak classifier selection based on...
158
click to vote
EOR
2008
15 years 6 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
173
click to vote
PRDC
2008
IEEE
16 years 12 days ago
2008
IEEE
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
140
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
149
click to vote
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
Thispaper presents a text word extraction algorithm that takes a set of bounding boxes of glyphs and their associated text lines of a given document andpartitions the glyphs into ...