2040 search results - page 131 / 408 » On the Complexity of Error Explanation |
STOC
2002
ACM
14 years 9 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
MSO
2003
13 years 10 months ago
2003
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
CANS
2009
Springer
14 years 3 months ago
2009
Springer
The XSL attack when applied on BES-128 has been shown to have an attack complexity of 2100 , which is faster than exhaustive search. However at FSE 2007, Lim and Khoo analyzed the ...
TPDS
2008
13 years 9 months ago
2008
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
ICANN
2009
Springer
14 years 3 months ago
2009
Springer
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...