2766 search results - page 60 / 554 » Algorithms for trigonometric polynomials |
87
Voted
CCCG
2007
15 years 2 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
115
Voted
CORR
2006
Springer
15 years 23 days ago
2006
Springer
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
ISSAC
1995
Springer
15 years 4 months ago
1995
Springer
We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtai...
140
click to vote
TCS
2011
14 years 7 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
100
Voted
ISSAC
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...