209 search results - page 9 / 42 » The Computational Complexity of Weak Saddles |
ICDAR
2009
IEEE
14 years 2 months 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...
ECSQARU
2009
Springer
14 years 2 months ago
2009
Springer
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
JACM
2002
13 years 7 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
CCGRID
2009
IEEE
14 years 2 months ago
2009
IEEE
— As the scale and complexity of parallel systems continue to grow, failures become more and more an inevitable fact for solving large-scale applications. In this research, we pr...