828 search results - page 22 / 166 » Bounded Hairpin Completion |
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Visual recognition and detection are computationally intensive tasks and current research efforts primarily focus on solving them without considering the computational capability ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
NIPS
2003
13 years 9 months ago
2003
In this paper we obtain convergence bounds for the concentration of Bayesian posterior distributions (around the true distribution) using a novel method that simplifies and enhan...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...