Sciweavers

9949 search results - page 1752 / 1990
» On the Network Complexity of Selection
Sort
View
ASIACRYPT
2007
Springer
16 years 24 days ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
DAWAK
2007
Springer
16 years 23 days ago
Mining Top-K Multidimensional Gradients
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
Ronnie Alves, Orlando Belo, Joel Ribeiro
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
16 years 23 days ago
Genetic optimization for yacht design
This paper introduces a procedure for using genetic multiobjective optimization in yacht design. The problem described consists on the optimization of a bulb shape to improve the ...
Paolo Geremia, Mauro Poian, Silvia Poles
SACRYPT
2007
Springer
16 years 22 days ago
Two Trivial Attacks on Trivium
Trivium is a stream cipher designed in 2005 by C. De Canni`ere and B. Preneel for the European project eSTREAM. It has successfully passed the first phase of the project and has ...
Alexander Maximov, Alex Biryukov
IROS
2006
IEEE
127views Robotics» more  IROS 2006»
16 years 19 days ago
Learning Predictive Features in Affordance based Robotic Perception Systems
This work is about the relevance of Gibson’s concept of affordances [1] for visual perception in interactive and autonomous robotic systems. In extension to existing functional ...
Gerald Fritz, Lucas Paletta, Ralph Breithaupt, Eri...
« Prev « First page 1752 / 1990 Last » Next »