485 search results - page 34 / 97 » Iterative Bounding LAO |
130
click to vote
ICIP
1994
IEEE
16 years 5 months ago
1994
IEEE
It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In ...
155
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
140
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We propose to use energy minimization in MRFs for matching-based image recognition tasks. To this end, the Tree-Reweighted Message Passing algorithm is modified by geometric cons...
132
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
163
click to vote
WORDS
2003
IEEE
15 years 9 months ago
2003
IEEE
Bounding the Worst Case Execution Time (WCET) of programs is essential for real-time systems. To be able to do WCET calculations, the iteration bounds for loops and recursion must...