2218 search results - page 272 / 444 » Testing Expressibility Is Hard |
ECCV
2004
Springer
14 years 11 months ago
2004
Springer
In this work, we present a novel approach to face recognition which considers both shape and texture information to represent face images. The face area is first divided into small...
ICLP
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
PODS
2007
ACM
14 years 9 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
SIGCSE
2010
ACM
14 years 4 months ago
2010
ACM
Programming exercise assessment tools alleviate the task of teachers, and increase consistency of markings. Many programming exercise assessment tools are based on testing. A test...