8824 search results - page 80 / 1765 » On the Complexity of Real Functions |
126
click to vote
LREC
2008
15 years 5 months ago
2008
The ultimate goal when building dialogue systems is to satisfy the needs of real users, but quality assurance for dialogue strategies is a non-trivial problem. The applied evaluat...
138
click to vote
COLT
2001
Springer
15 years 8 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
121
click to vote
EMMCVPR
1999
Springer
15 years 8 months ago
1999
Springer
Size functions are functions from the real plane to thenatural numbers useful for describing shapes of objects. They allow to translate the problem of comparing shapes to the probl...
108
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
123
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...