1369 search results - page 108 / 274 » Lattice computations for random numbers |
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
110
click to vote
TSP
2010
14 years 4 months ago
2010
Nonparametric Bayesian methods are employed to constitute a mixture of low-rank Gaussians, for data x RN that are of high dimension N but are constrained to reside in a low-dimen...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
100
click to vote
IEEEPACT
1997
IEEE
15 years 2 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
126
click to vote
FOCS
1993
IEEE
15 years 2 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...