58 search results - page 5 / 12 » Two Families of Algorithms for Symbolic Polynomials |
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Segmentation, the task of splitting a long sequence of discrete symbols into chunks, can provide important information about the nature of the sequence that is understandable to...
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
MP
1998
13 years 8 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
COMPGEOM
1995
ACM
14 years 10 days ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...