2168 search results - page 221 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
144
click to vote
CIBCB
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— Quantum mechanics and molecular dynamic simulation provide important insights into structural configurations and molecular interaction data today. To extend this atomi...
149
Voted
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
147
click to vote
RT
2000
Springer
15 years 8 months ago
2000
Springer
Rapidly simulating global illumination, including diffuse and glossy light transport is a very difficult problem. Finite element or radiosity approaches can achieve interactive si...
163
Voted
SAC
2005
ACM
15 years 10 months ago
2005
ACM
Active learning is a generic approach to accelerate training of classifiers in order to achieve a higher accuracy with a small number of training examples. In the past, simple ac...
120
click to vote
ASIACRYPT
2003
Springer
15 years 10 months ago
2003
Springer
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...