462 search results - page 86 / 93 » Symbolic Bounded Synthesis |
106
click to vote
JCSS
2010
15 years 7 days ago
2010
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
126
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
219
Voted
CADE
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
113
click to vote
DAC
2006
ACM
16 years 2 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
101
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We investigate dynamical models of human motion that can
support both synthesis and analysis tasks. Unlike coarser
discriminative models that work well when action classes are ...