253 search results - page 5 / 51 » Algorithms for the Approximate Common Divisor Problem |
ICCAD
1996
IEEE
15 years 1 months ago
1996
IEEE
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
74
Voted
ISSAC
2005
Springer
15 years 3 months ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
STRINGOLOGY
2004
14 years 11 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
ICIP
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper we examine the applicability of the previously proposed Greatest Common Divisor (GCD) method to blind image deconvolution. In this method, the desired image is appro...
TC
2011
14 years 4 months ago
2011
—This paper considers the problem of dividing a two-word integer by a single-word integer, together with a few extensions and applications. Due to lack of efficient division ins...