1041 search results - page 52 / 209 » Randomizing Reductions of Search Problems |
EUROCRYPT
2010
Springer
13 years 11 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
FPL
2010
Springer
13 years 6 months ago
2010
Springer
A Multivariate Gaussian random number generator (MVGRNG) is an essential block for many hardware designs, including Monte Carlo simulations. These simulations are usually used in a...
CLEF
2010
Springer
13 years 8 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...