Sciweavers

2766 search results - page 83 / 554
» Algorithms for trigonometric polynomials
Sort
View
82
Voted
CORR
2010
Springer
159views Education» more  CORR 2010»
15 years 27 days ago
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination metho...
Eric Berberich, Pavel Emeliyanenko, Michael Sagral...
93
Voted
CORR
2011
Springer
186views Education» more  CORR 2011»
14 years 7 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
99
Voted
ICML
2009
IEEE
16 years 1 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
137
Voted
JMM2
2008
157views more  JMM2 2008»
15 years 23 days ago
Multiresolution Feature Based Fractional Power Polynomial Kernel Fisher Discriminant Model for Face Recognition
This paper presents a technique for face recognition which uses wavelet transform to derive desirable facial features. Three level decompositions are used to form the pyramidal mul...
Dattatray V. Jadhav, Jayant V. Kulkarni, Raghunath...
74
Voted
COCO
2008
Springer
72views Algorithms» more  COCO 2008»
15 years 2 months ago
The Sum of d Small-Bias Generators Fools Polynomials of Degree d
We prove that the sum of d small-bias generators L : Fs Fn fools degree-d polynomials in n variables over a field F, for any fixed degree d and field F, including F = F2 = {0, 1}...
Emanuele Viola