6142 search results - page 527 / 1229 » The Complexity of Partition Functions |
187
click to vote
ASIACRYPT
2008
Springer
15 years 9 months ago
2008
Springer
MISTY1 is a Feistel block cipher that received a great deal of cryptographic attention. Its recursive structure, as well as the added FL layers, have been successful in thwarting v...
175
click to vote
FDL
2008
IEEE
15 years 8 months ago
2008
IEEE
Nowadays interactive electronics products offer a huge functionality to prospective customers, but often it is too huge and complex to be grasped and used successfully. In this ca...
200
Voted
ACL
2006
15 years 8 months ago
2006
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
201
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
138
click to vote
APAL
2008
15 years 7 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...