2766 search results - page 198 / 554 » Algorithms for trigonometric polynomials |
144
click to vote
CAP
2010
14 years 11 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
130
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
The Macaulay2 package PHCpack.m2 provides an interface to some of the functionality of PHCpack, a general-purpose solver for polynomial systems by homotopy continuation. The main f...
153
click to vote
IACR
2011
14 years 4 months ago
2011
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
139
click to vote
ISSAC
2005
Springer
15 years 10 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
143
click to vote
EMMCVPR
2001
Springer
15 years 9 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...