2766 search results - page 77 / 554 » Algorithms for trigonometric polynomials |
110
click to vote
JMLR
2002
15 years 13 days ago
2002
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
94
Voted
CSR
2008
Springer
15 years 2 months ago
2008
Springer
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
DISOPT
2007
15 years 22 days ago
2007
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...
93
Voted
JSC
2006
15 years 22 days ago
2006
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
134
Voted
DLOG
2011
14 years 4 months ago
2011
We show that, although conjunctive queries over OWL 2 QL ontologies are reducible to database queries, no algorithm can construct such a reduction in polynomial time without changi...