Sciweavers

194 search results - page 3 / 39
» Better polynomials for GNFS
Sort
View
COCOON
2006
Springer
14 years 1 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
JEI
2010
123views more  JEI 2010»
13 years 4 months ago
Estimating reflectance from multispectral camera responses based on partial least-squares regression
Abstract. In multispectral imaging systems, the accuracy of reflectance estimation can be degraded by the nonlinearity in imaging process, which is due to non-Gaussian distribution...
Hui-Liang Shen, Hui-Jiang Wan, Zhe-Chao Zhang
CVPR
1999
IEEE
14 years 10 months ago
Algebraic Curves That Work Better
An algebraic curve is defined as the zero set of a polynomial in two variables. Algebraic curves are practical for modeling shapes much more complicated than conics or su...
David B. Cooper, Jean-Philippe Tarel, Tolga Tasdiz...
ECCC
2010
90views more  ECCC 2010»
13 years 9 months ago
A note on circuit lower bounds from derandomization
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales b...
Scott Aaronson, Dieter van Melkebeek
FCT
2007
Springer
14 years 1 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...