3907 search results - page 186 / 782 » Time, Knowledge, and Choice |
141
click to vote
DATE
2006
IEEE
16 years 19 days ago
2006
IEEE
Recently, the interest about the Tate pairing over binary fields has decreased due to the existence of efficient attacks to the discrete logarithm problem in the subgroups of su...
167
click to vote
ICA3PP
2005
Springer
16 years 2 days ago
2005
Springer
In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring ...
161
click to vote
CIS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from...
166
click to vote
TAPIA
2003
ACM
15 years 11 months ago
2003
ACM
We present a method for simulating rigid multibody dynamics with joints, contact, and friction. In this work, the nonsmooth contact and frictional constraints are represented by h...
145
click to vote
EVOW
2003
Springer
15 years 11 months ago
2003
Springer
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as...