1695 search results - page 37 / 339 » Linear, Polynomial or Exponential |
97
Voted
AI
1998
Springer
15 years 13 days ago
1998
Springer
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
85
Voted
JC
2008
15 years 21 days ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
114
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
103
click to vote
CISS
2008
IEEE
15 years 7 months ago
2008
IEEE
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
112
click to vote
ALGORITHMICA
2008
15 years 26 days ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion