2430 search results - page 218 / 486 » Computing Tutte Polynomials |
129
click to vote
AAECC
2007
Springer
15 years 4 months ago
2007
Springer
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
120
click to vote
AI
2007
Springer
15 years 4 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
131
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
122
click to vote
AMC
2010
15 years 4 months ago
2010
Elimination is a basic algebraic operation which geometrically corresponds to projections. This article describes using the numerical algebraic geometric concept of witness sets t...
121
click to vote
EOR
2008
15 years 4 months ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...