29908 search results - page 229 / 5982 » On the Complexity of |
145
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one i...
200
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
169
click to vote
ICDAR
2009
IEEE
16 years 1 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...
180
click to vote
ICPP
2009
IEEE
16 years 1 months ago
2009
IEEE
The multicore revolution is underway, bringing new chips introducing more complex memory architectures. Classical algorithms must be revisited in order to take the hierarchical me...
156
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...