2430 search results - page 299 / 486 » Computing Tutte Polynomials |
129
click to vote
COMPGEOM
2000
ACM
15 years 7 months ago
2000
ACM
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...
146
click to vote
ESA
2000
Springer
15 years 7 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
142
Voted
ECSQARU
1995
Springer
15 years 7 months ago
1995
Springer
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
161
click to vote
ISSAC
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
113
click to vote
TAPSOFT
1991
Springer
15 years 7 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...