10715 search results - page 131 / 2143 » From Tests to Proofs |
RANDOM
1997
Springer
14 years 1 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
Existing cover song detection systems require prior knowledge of the number of cover songs in a test set in order to identify cover(s) to a reference song. We describe a system th...
JIPS
2008
13 years 9 months ago
2008
: Minimum support and confidence have been used as criteria for generating association rules in all association rule mining algorithms. These criteria have their natural appeals, s...
SIGADA
2005
Springer
14 years 3 months ago
2005
Springer
Recent trends in software re-engineering have included tools to extract program slices from existing Ada procedures. One such tool has already been developed that extracts program...
LPAR
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...