1017 search results - page 89 / 204 » Some existence and construction results of polygonal designs |
176
click to vote
IH
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Users of some systems are at risk of being compelled to disclose their keys or other private data, and this risk could be mitigated if access control mechanisms supported...
146
click to vote
ACISP
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
175
click to vote
DM
2008
15 years 5 months ago
2008
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
168
click to vote
RE
1997
Springer
15 years 10 months ago
1997
Springer
—Formal methods have yet to achieve wide industrial acceptance for several reasons. They are not well integrated into hed industrial software processes, their application require...
150
click to vote
IJCNN
2007
IEEE
16 years 21 days ago
2007
IEEE
– Constructive algorithms are effective methods for designing Artificial Neural Networks (ANN) with good accuracy and generalization capability, yet with parsimonious network str...