1291 search results - page 18 / 259 » Computing the multiplicity structure in solving polynomial s... |
ISMB
1997
13 years 9 months ago
1997
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...
NA
2010
13 years 6 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 ...
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
We study the multiplication of multivariate power series. We show that over large enough fields, the bilinear complexity of the product modulo a monomial ideal M is bounded by th...
ICPPW
2006
IEEE
14 years 1 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
A negotiation chain is formed when multiple related negotiations are spread over multiple agents. In order to appropriately order and structure the negotiations occurring in the c...