2766 search results - page 111 / 554 » Algorithms for trigonometric polynomials |
134
Voted
ESOP
2010
Springer
15 years 10 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....
130
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
105
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
109
click to vote
SIGGRAPH
1994
ACM
15 years 8 months ago
1994
ACM
An algorithm for creating smooth spline surfaces over irregular meshes is presented. The algorithm is a generalization of quadratic B-splines; that is, if a mesh is (locally) regu...
115
click to vote
AAECC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generate...