590 search results - page 65 / 118 » Resolution-stationary random number generators |
145
click to vote
JOC
2002
15 years 4 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 ...
171
click to vote
SAC
2003
ACM
15 years 9 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
126
click to vote
RSA
2010
15 years 2 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
143
click to vote
DMIN
2006
15 years 5 months ago
2006
The stochastic discrimination (SD) theory considers learning as building models of uniform coverage over data distributions. Despite successful trials of the derived SD method in s...
124
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based ...