2629 search results - page 80 / 526 » complex 2009 |
FSE
2009
Springer
15 years 1 months ago
2009
Springer
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitiv...
158
click to vote
ISSAC
2011
Springer
14 years 21 days ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We propose an importance weighting framework for actively labeling samples. This technique yields practical yet sound active learning algorithms for general loss functions. Experi...
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
— The paper describes the control and the navigation of a skiing robot that is capable of autonomous skiing on a ski slope using the carving skiing technique. Based on a complex ...
CIE
2009
Springer
15 years 4 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...