83 search results - page 10 / 17 » Algebraic Curves That Work Better |
STOC
2007
ACM
15 years 9 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
175
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
KES
2008
Springer
14 years 9 months ago
2008
Springer
I argue that data becomes temporarily interesting by itself to some self-improving, but computationally limited, subjective observer once he learns to predict or compress the data...
TC
2008
14 years 9 months ago
2008
Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with availabl...
CONCURRENCY
2007
14 years 9 months ago
2007
We propose in this paper a distributed packed storage format that exploits the symmetry or the triangular structure of a dense matrix. This format stores only half of the matrix w...