Sciweavers

1368 search results - page 45 / 274
» Generalized Rook Polynomials
Sort
View
LATIN
2010
Springer
15 years 6 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
ICDE
2010
IEEE
233views Database» more  ICDE 2010»
15 years 5 months ago
Polynomial heuristics for query optimization
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
Nicolas Bruno, César A. Galindo-Legaria, Mi...
COLT
2008
Springer
15 years 1 months ago
Polynomial Regression under Arbitrary Product Distributions
In recent work, Kalai, Klivans, Mansour, and Servedio [KKMS05] studied a variant of the "Low-Degree (Fourier) Algorithm" for learning under the uniform probability distr...
Eric Blais, Ryan O'Donnell, Karl Wimmer
NC
1998
101views Neural Networks» more  NC 1998»
15 years 1 months ago
Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks
In this paper a new approach for approximation problems involving only few input and output parameters is presented and compared to traditional Backpropagation Neural Networks (BP...
Günther R. Raidl, Gabriele Kodydek
CORR
2004
Springer
94views Education» more  CORR 2004»
14 years 11 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson