10608 search results - page 649 / 2122 » Complexity of O'Hara's Algorithm |
194
click to vote
AISC
1998
Springer
15 years 11 months ago
1998
Springer
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization....
209
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper we present an algorithm for converting a BDD representation of a logic function into a multiple-level netlist of disjoint-support subfunctions. On the theoretical si...
165
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
Logic synthesis systems are complex systems and algorithmic research in synthesis has become highly specialized. This creates a gap where it is often not clear how an advance in a...
183
click to vote
LPNMR
1997
Springer
15 years 11 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
166
click to vote
RT
1997
Springer
15 years 11 months ago
1997
Springer
Abstract: This paper surveys global illumination algorithms for environments including participating media and accounting for multiple scattering. The objective of this survey is t...