440 search results - page 17 / 88 » On partial randomness |
176
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
104
click to vote
DCC
2003
IEEE
15 years 11 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
MOR
2006
14 years 11 months ago
2006
We consider repeated games in which the player, instead of observing the action chosen by the opponent in each game round, receives a feedback generated by the combined choice of ...
106
click to vote
JOC
2002
14 years 11 months ago
2002
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
STOC
1990
ACM
15 years 3 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...