Sciweavers

48 search results - page 5 / 10
» Division algorithms for Bernstein polynomials
Sort
View
DAGSTUHL
2008
13 years 9 months ago
Real Algebraic Numbers: Complexity Analysis and Experimentation
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 7 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
MOC
2011
12 years 10 months ago
Calculating cyclotomic polynomials
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
Andrew Arnold, Michael B. Monagan
IMAMS
2007
157views Mathematics» more  IMAMS 2007»
13 years 9 months ago
Regularity Criteria for the Topology of Algebraic Curves and Surfaces
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
Lionel Alberti, Bernard Mourrain
COLT
2008
Springer
13 years 9 months ago
Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains
We propose a model-based learning algorithm, the Adaptive Aggregation Algorithm (AAA), that aims to solve the online, continuous state space reinforcement learning problem in a de...
Andrey Bernstein, Nahum Shimkin