2766 search results - page 67 / 554 » Algorithms for trigonometric polynomials |
CORR
2006
Springer
15 years 23 days ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
106
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
88
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
106
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
123
Voted
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...