358 search results - page 65 / 72 » Sparse squares of polynomials |
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
ICVGIP
2008
14 years 11 months ago
2008
The primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number o...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classiļ¬er Systems and the XCS classiļ¬er system in particular in datamining, reinforcement learning, and func...
113
click to vote
SMA
2009
ACM
15 years 3 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
ACISP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Multivariate public-key cryptosystems (sometimes polynomial-based PKCās or just multivariates) handle polynomials of many variables over relatively small ļ¬elds instea...