1265 search results - page 145 / 253 » Finding the Key to a Synapse |
138
click to vote
ACISP
2010
Springer
15 years 7 months ago
2010
Springer
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . ...
145
click to vote
FSE
2008
Springer
15 years 7 months ago
2008
Springer
We show that the LASH-x hash function is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4x/11) and preimage attacks as fast as 2(4x/7) ....
155
click to vote
AAAI
2010
15 years 7 months ago
2010
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
155
click to vote
CSC
2008
15 years 7 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
172
click to vote
MEDIAFORENSICS
2010
15 years 7 months ago
2010
This paper considers the security aspect of the robust zero-bit watermarking technique `Broken Arrows'(BA),1 which was invented and tested for the international challenge BOW...