4451 search results - page 442 / 891 » On Random Ordering Constraints |
186
click to vote
PPAM
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
163
click to vote
SACRYPT
2005
Springer
16 years 10 days ago
2005
Springer
In this paper we study the substitution-permutation network (SPN) on which AES is based. We introduce AES∗ , a SPN identical to AES except that fixed S-boxes are replaced by ran...
192
Voted
COMPGEOM
2004
ACM
16 years 9 days ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
163
click to vote
ASIACRYPT
2004
Springer
16 years 8 days ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Di...
154
Voted
EUROCRYPT
2004
Springer
16 years 8 days ago
2004
Springer
An aggregate signature scheme (recently proposed by Boneh, Gentry, Lynn, and Shacham) is a method for combining n signatures from n different signers on n different messages int...