2766 search results - page 316 / 554 » Algorithms for trigonometric polynomials |
173
click to vote
NA
2010
15 years 3 months ago
2010
It is well known that it is an ill-posed problem to decide whether a function has a multiple root. Even for a univariate polynomial an arbitrary small perturbation of a polynomial ...
131
click to vote
NETWORKS
2010
15 years 3 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
129
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
In 1994, Y. Mansour conjectured that for every DNF formula on n variables with t terms there exists a polynomial p with tO(log(1/)) non-zero coefficients such that Ex{0,1}n [(p(x)...
215
Voted
WINE
2010
Springer
15 years 2 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
163
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....