1369 search results - page 71 / 274 » Lattice computations for random numbers |
ILP
2005
Springer
14 years 2 months ago
2005
Springer
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
SAC
2010
ACM
14 years 3 months ago
2010
ACM
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
NAA
2000
Springer
14 years 15 days ago
2000
Springer
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...