828 search results - page 22 / 166 » Bounded Hairpin Completion |
108
Voted
RTA
2010
Springer
15 years 4 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...
104
Voted
CVPR
2010
IEEE
15 years 8 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 ...
112
Voted
STACS
2007
Springer
15 years 6 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...
94
Voted
NIPS
2003
15 years 1 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...
134
Voted
CSL
2007
Springer
15 years 6 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...