Sciweavers

4639 search results - page 883 / 928
» A General Method for Errors-in-Variables Problems in Compute...
Sort
View
ASIACRYPT
2007
Springer
14 years 2 months 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é...
GECCO
2007
Springer
135views Optimization» more  GECCO 2007»
14 years 2 months ago
A cumulative evidential stopping criterion for multiobjective optimization evolutionary algorithms
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
Luis Martí, Jesús García, Ant...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 2 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
VRML
2003
ACM
14 years 1 months ago
3D virtual clothing: from garment design to web3d visualization and simulation
One of the major challenges in Computer Graphics concerns the 3D representation and physically-based simulation of garments. In our research, we are working closely with the texti...
Luca Chittaro, Demis Corvaglia
FCCM
2006
IEEE
111views VLSI» more  FCCM 2006»
14 years 2 months ago
Pipelined Mixed Precision Algorithms on FPGAs for Fast and Accurate PDE Solvers from Low Precision Components
FPGAs are becoming more and more attractive for high precision scientific computations. One of the main problems in efficient resource utilization is the quadratically growing r...
Robert Strzodka, Dominik Göddeke